The Prospects for Mathematical Logic in the Twenty-First Century

DOI10.2307/2687773zbMath0981.03003OpenAlexW1653380582MaRDI QIDQ2736583

Richard A. Shore, Alexander S. Kechris, Anand Pillay, Samuel R. Buss

Publication date: 10 September 2001

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/38610/

zbMATH Keywords

model theoryproof theoryset theoryrecursion theorycomputer science logic

Mathematics Subject Classification ID

History of mathematics in the 21st century (01A61) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Future perspectives in mathematics (01A67)

Related Items (4)

Fractals and the monadic second order theory of one successor ⋮ Execution trace sets for real computation ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ On the correspondence between arithmetic theories and propositional proof systems – a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptive set theory
• Infinite Abelian groups, Whitehead problem and some constructions
• Progress in mathematics
• Finite functions and the necessary use of large cardinals
• The axiom of determinacy, forcing axioms, and the nonstationary ideal
• Positive reducibility of the interior of filled Julia sets
• Simple theories
• Defining the Turing jump
• The polynomial topological complexity of Fatou-Julia sets
• A Borel reductibility theory for classes of countable structures
• An Outline of Inner Model Theory
• The jump is definable in the structure of the degrees of unsolvability
• Supercompact cardinals, sets of reals, and weakly homogeneous trees
• A trichotomy theorem for o-minimal structures
• Simple unstable theories
• Partition Problems in Topology
• Quantifier elimination for neocompact sets
• Step by Recursive Step: Church's Analysis of Effective Calculability
• The completeness of the isomorphism relation for countable Boolean algebras
• Forking in Simple Unstable Theories
• Zariski geometries
• The fine structure of the constructible hierarchy
• The Mordell-Lang conjecture for function fields
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function

This page was built for publication: The Prospects for Mathematical Logic in the Twenty-First Century