Nonstandard models in recursion theory and reverse mathematics
From MaRDI portal
combinatorial principlesfragments of Peano arithmeticnonstandard modelsRamsey's theorem for pairsreverse mathematicsreverse recursion theorysurvey paper
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)
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
Cites work
- \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- A cohesive set which is not high
- An easy priority-free proof of a theorem of Friedberg
- Bounding minimal pairs
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Corrigendum to: ``On the strength of Ramsey's theorem for pairs
- Friedberg numbering in fragments of Peano arithmetic and -recursion theory
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- On suborderings of the α-recursively enumerable α-degrees
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- On the strength of Ramsey's theorem for pairs
- Ramsey's theorem and recursion theory
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- Recursively enumerable generic sets
- Reverse mathematics and Ramsey's property for trees
- Reverse mathematics, computability, and partitions of trees
- The fine structure of the constructible hierarchy
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- The strength of the rainbow Ramsey Theorem
- Working below a high recursively enumerable degree
Cited in
(13)- On the strength of Ramsey's theorem for trees
- The strength of compactness in computability theory and nonstandard analysis
- Coloring trees in reverse mathematics
- Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction
- 1-Generic Degrees Bounding Minimal Degrees Revisited
- Recursively saturated nonstandard models of arithmetic; addendum
- Nonstandard methods in Ramsey's theorem for pairs
- Computability theory, nonstandard analysis, and their connections
- Open questions about Ramsey-type statements in reverse mathematics
- On some uses of nonstandard models
- Nonstandard arithmetic and recursive comprehension
- Isolated d.c.e. degrees and _1 induction
- Notes on Sacks' splitting theorem
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)
