Nonstandard models in recursion theory and reverse mathematics
DOI10.1017/BSL.2014.14zbMATH Open1341.03098OpenAlexW2133902039MaRDI QIDQ2925331FDOQ2925331
Authors: Wei Li, Yue Yang, C. T. 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
Recommendations
- scientific article; zbMATH DE number 7377981
- Nonstandard methods in Ramsey's theorem for pairs
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Nonstandard arithmetic and recursive comprehension
- The strength of compactness in computability theory and nonstandard analysis
survey paperreverse mathematicsfragments of Peano arithmeticnonstandard modelscombinatorial principlesRamsey's theorem for pairsreverse recursion theory
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models in mathematics (03H05)
Cites Work
- The fine structure of the constructible hierarchy
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A cohesive set which is not high
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Ramsey's theorem and recursion theory
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- The strength of the rainbow Ramsey Theorem
- Reverse mathematics and Ramsey's property for trees
- Corrigendum to: ``On the strength of Ramsey's theorem for pairs
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- On suborderings of the α-recursively enumerable α-degrees
- Recursively enumerable generic sets
- Bounding minimal pairs
- An easy priority-free proof of a theorem of Friedberg
- Working below a high recursively enumerable degree
- Reverse mathematics, computability, and partitions of trees
- \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture
- Friedberg Numbering in Fragments of Peano Arithmetic and α-Recursion Theory
Cited In (9)
- Nonstandard arithmetic and recursive comprehension
- Nonstandard methods in Ramsey's theorem for pairs
- Comparing the strength of diagonally nonrecursive functions in the absence of \(\Sigma_2^0\) induction
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- On some uses of nonstandard models
- 1-Generic Degrees Bounding Minimal Degrees Revisited
- Coloring trees in reverse mathematics
- Recursively saturated nonstandard models of arithmetic; addendum
- On the strength of Ramsey's theorem for trees
This page was built for publication: Nonstandard models in recursion theory and reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925331)
