Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
DOI10.1090/MEMO/1187zbMATH Open1406.03039OpenAlexW2534696914MaRDI QIDQ5366979FDOQ5366979
Authors: Denis R. Hirschfeldt, Karen Lange, Richard A. Shore 
Publication date: 10 October 2017
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://repository.wellesley.edu/scholarship/128
Recommendations
- \(\mathsf{WKL}_0\) and induction principles in model theory
- The atomic model theorem and type omitting
- Computable reductions and reverse mathematics
- On notions of computability-theoretic reduction between Π21 principles
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
inductionreverse mathematicscomputable model theorygenericshomogeneous modelsatomic modelsboundinguniform reductionAMTWeihrauchATTFATTHMT
Models with special properties (saturated, rigid, etc.) (03C50) Foundations of classical theories (including reverse mathematics) (03B30) Basic properties of first-order languages and structures (03C07) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30) Model theory of denumerable and separable structures (03C15) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Subsystems of second order arithmetic
- Model Theory
- Model theory.
- Computable structures and the hyperarithmetical hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the strength of Ramsey's theorem for pairs
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Title not available (Why is that?)
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Finite injury and Σ1-induction
- Splitting an α-Recursively Enumerable Set
- Computability of homogeneous models
- Title not available (Why is that?)
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Reverse mathematics: the playground of logic
- Open questions in reverse mathematics
- The atomic model theorem and type omitting
- Bounding prime models
- On the strength of Ramsey's theorem
- Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
- Recursively presentable prime models
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Higher set theory and mathematical practice
- Strong constructivizability of homogeneous models
- Decidable models
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- Classifying model-theoretic properties
- On uniform relationships between combinatorial problems
- On notions of computability-theoretic reduction between Π21 principles
- On the Equimorphism Types of Linear Orderings
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- Reverse mathematics, countable and uncountable
- Homogeneous models and decidability
- Degree spectra of prime models
- Title not available (Why is that?)
- Bounding homogenous models
- Periodic points and subsystems of second-order arithmetic
- Title not available (Why is that?)
- Reverse mathematics of first-order theories with finitely many models
- The degree spectra of homogeneous models
- The strength of Turing determinacy within second order arithmetic
- A characterization of the \(0\)-basis homogeneous bounding degrees
Cited In (5)
This page was built for publication: Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366979)
