Richard A. Shore

Goldwin Smith Professor Emeritus of Mathematics

Publications

The Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength (with A. Montalban), Israel Journal of Mathematics, 204 (2014), 477-508.
Reverse mathematics: the playground of logic, Bulletin of Symbolic Logic 16 (2010), 378–402.
Direct and local definitions of the Turing jump, Journal of Mathematical Logic 7 (2007), 229–262.
Degree structures: local and global investigations, Bulletin of Symbolic Logic 12 (2006), 369–389.
Combinatorial principles weaker than Ramsey’s Theorem for pairs (with D. Hirschfeldt), Journal of Symbolic Logic 72 (2007), 171–206.
Boolean algebras, invariants and ACA_0^+, Transactions of the American Mathematical Society 358 (2006), 989–1014.
Computable structures: presentations matter; In the Scope of Logic, Methodology and the Philosophy of Science, Vol. 1, International Congress of LMPS, Cracow, August 1999 (P. Gardenfors, J. Wolenski and K. Kijania-Placek, eds.), Synthese Library 315, Kluwer Academic Publishers, Dordrecht, 2002, pp. 81–95.
Logic for Applications (with A. Nerode), Texts and Monographs in Computer Science, Springer-Verlag, New York, 1993; second edition, Graduate Texts in Computer Science, Springer-Verlag, New York, 1997.
The degrees of unsolvability: the ordering of functions by relative computability; in Proceedings of the International Congress of Mathematicians (Warsaw) 1983, PWN-Polish Scientific Publishers, Warsaw 1984, Vol. 1, 337–346.

Anil Nerode

Distinguished Professor of Arts and Sciences in Mathematics

Publications

Logic, Categories, Lambda Calculus (with R. Platek, G. Odifreddi), in preparation, 500 pp.
Finsler Control Theory and its applications (with W. Kohn, V. Brayman), in preparation, 300 pp.
Tableaux for constructive concurrent dynamic logic (with D. Wijesekera), Annals of Pure and Applied Logic 135 (2005), 1–72.
Effective completeness theorems for modal logic (with S. Ganguli), Annals of Pure and Applied Logic 128 no. 1-3 (2004), 141–195.
Control synthesis in hybrid systems with Finsler dynamics (with Wolf Kohn and Vladimir Brayman), Houston Journal of Mathematics 28 no. 2 (2003), 353–375.
Control in hybrid systems (with W. Kohn, V. Brayman, and P. Cholewinski), Int. J. Hybrid Systems 3 (2003).
Automata Theory and Its Applications (with Bakhadyr Khoussainov), Birkhauser, 2001, 430 pp.

I am also an editor of journals in these fields.

Justin Moore

Professor

Publications

A nonamenable finitely presented group of piecewise projective homeomorphisms (with Yash Lodha), Groups Geom. Dyn. 10 (2016), no. 1, 177–200.
Fast growth in the Følner function for Thompson's group F. Groups, Geometry, and Dynamics 7 (2013), no. 3, pp. 633–651.
Forcing axioms and the continuum hypothesis (with David Aspero and Paul Larson), Acta Mathematica. 210 (2013), no. 1, pp. 1-29.
A Boolean action of C(M,U(1))C(M,U(1)) without a spatial model and a re-examination of the Cameron-Martin Theorem (Solecki, Slawomir), J. Funct. Anal. 263 (2012), no. 10, pp. 3224–3234.
The proper forcing axiom. Proceedings of the International Congress of Mathematicians, Volume II, 3–29, Hindustan Book Agency, New Delhi, 2010.
A solution to the L space problem, Journal of the American Mathematical Society 19 no. 3 (2006), pp. 717–736.
A five element basis for the uncountable linear orders, Annals of Mathematics (2) 163 no. 2 (2006), pp. 669–688.

Dexter Kozen

Joseph Newton Pew, Jr. Professor in Engineering

Publications

Language constructs for non-well-founded computation (with Jean-Baptiste Jeannin and Alexandra Silva), in Matthias Felleisen and Philippa Gardner, editors, 22nd European Symposium on Programming (ESOP 2013), volume 7792 of Lecture Notes in Computer Science, pages 61-80, Rome, Italy, March 2013. Springer.
On Moessner’s theorem (with Alexandra Silva), The American Mathematical Monthly, 120(2):131-139, February 2013.
Left-handed completeness (with Alexandra Silva), in Wolfram Kahl and Timothy G. Griffin, editors, Proc. Conf. Relational and Algebraic Methods in Computer Science (RAMiCS 2012), volume 7560 of Lecture Notes in Computer Science, pages 162-178, Cambridge, UK, September 2012. Springer.
New; in Proc. 28th Conf. Math. Found. Programming Semantics (MFPS XXVIII), Bath, England, June 2012, Elsevier Electronic Notes in Theoretical Computer Science (Ulrich Berger and Michael Mislove, eds.), 13–38.
Realization of coinductive types; in Proc. 27th Conf. Math. Found. Programming Semantics (MFPS XXVII), Pittsburgh, PA, May 2011, Elsevier Electronic Notes in Theoretical Computer Science (Michael Mislove and Joel Ouaknine, eds.), 148–155.

Joseph Halpern

Professor

Robert L. Constable

Professor

Subscribe to Logic