|
Cameron Freer
Instructor of Pure Mathematics
2-346
Office Phone: (617) 324-2614 |
![]() |
|
|
Research My research interests are in mathematical logic and computability theory, especially computable model theory, computable probability theory, and formalized mathematics. My PhD thesis, Models with High Scott Rank, was completed in 2008 under the supervision of Gerald Sacks at Harvard University, and uses methods from higher recursion theory to approach a problem in computable model theory. Computable exchangeable sequences have computable de Finetti measures, with Daniel Roy, to appear in Proceedings of Computability in Europe (CiE 2009). (Preprint available upon request.)
Logic Seminar Mia Minnes and I jointly organize the MIT Logic Seminar, which meets most Wednesdays at 4:30 pm.
Courses Fall 2008: 18.03: Differential Equations
Spring 2009: 18.575: Model Theory
(Office Hours: Tues. and Thurs. 1:30-2:30pm)
|
||