NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS

DOI10.1017/bsl.2014.14zbMath1341.03098OpenAlexW2133902039MaRDI QIDQ2925331

Wei Li, Yue Yang, Chi Tat Chong

Publication date: 21 October 2014

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

Full work available at URL: https://semanticscholar.org/paper/f1fd417fbd9b4b12d21ab0648d85a3f695353c9b

zbMATH Keywords

survey papernonstandard modelsreverse mathematicsfragments of Peano arithmeticcombinatorial principlesRamsey's theorem for pairsreverse recursion theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models in mathematics (03H05) Theory of numerations, effectively presented structures (03D45)

Related Items

Coloring trees in reverse mathematics, On the strength of Ramsey's theorem for trees, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, 1-Generic Degrees Bounding Minimal Degrees Revisited, COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION

Cites Work

• Unnamed Item
• Unnamed Item
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• An easy priority-free proof of a theorem of Friedberg
• On the strength of Ramsey's theorem for pairs
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Reverse mathematics, computability, and partitions of trees
• The strength of the rainbow Ramsey Theorem
• Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
• Bounding minimal pairs
• Recursively enumerable generic sets
• Working below a high recursively enumerable degree
• A cohesive set which is not high
• Random reals, the rainbow Ramsey theorem, and arithmetic conservation
• Reverse mathematics and Ramsey's property for trees
• Friedberg Numbering in Fragments of Peano Arithmetic and α-Recursion Theory
• The fine structure of the constructible hierarchy
• On suborderings of the α-recursively enumerable α-degrees
• Ramsey's theorem and recursion theory
• \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture