The prospects for mathematical logic in the twenty-first century

DOI10.2307/2687773zbMATH Open0981.03003OpenAlexW1653380582MaRDI QIDQ2736583FDOQ2736583

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

Publication date: 10 September 2001

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

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

Recommendations

• scientific article; zbMATH DE number 2078138
• What Is Mathematical Logic? A Survey
• scientific article; zbMATH DE number 2003401
• scientific article; zbMATH DE number 1359342
• Symbioses between mathematical logic and computer science

zbMATH Keywords

proof theorymodel theoryrecursion theoryset theorycomputer science logic

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fractals and the monadic second order theory of one successor
• On the correspondence between arithmetic theories and propositional proof systems – a survey
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Execution trace sets for real computation

This page was built for publication: The prospects for mathematical logic in the twenty-first century

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736583)