Bibliography

Bibliography sorted by Mathematical Subject Classification

• 03B30 Foundations of classical theories (including reverse mathematics)
• 03C57 Effective and recursion-theoretic model theory
• 03C62 Models of arithmetic and set theory
• 03C70 Logic on admissible sets
• 03D15 Complexity of computation
• 03D20 Recursive functions and relations, subrecursive hierarchies
• 03D25 Recursively (computably) enumerable sets and degrees
• 03D28 Other Turing degree structures
• 03D30 Other degrees and reducibilities
• 03D35 Undecidability and degrees of sets of sentences
• 03D45 Theory of numerations, effectively presented structures
• 03D50 Recursive equivalence types of sets and structures, isols
• 03D55 Hierarchies
• 03D60 Computability and recursion theory on ordinals, admissible sets, etc.
• 03D65 Higher-type and set recursion theory
• 03D80 Applications of computability and recursion theory
• 03Dxx Computability and recursion theory
• 03E15 Descriptive set theory
• 03E35 Consistency and independence results
• 03E40 Other aspects of forcing and Boolean-valued models
• 03E45 Inner models, including constructibility, ordinal definability, and core models
• 03E50 Continuum hypothesis and Martin's axiom
• 03E60 Determinacy principles
• 03F30 First-order arithmetic and fragments
• 03F35 Second- and higher-order arithmetic and fragments
• 03H15 Nonstandard models of arithmetic
• 06A05 Total order
• 68Q05 Models of computation (Turing machines, etc.)
• 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
• 68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)
• 68Q32 Computational learning theory