Induction, bounding, weak combinatorial principles, and the homogeneous model theorem

DOI10.1090/MEMO/1187MaRDI QIDQ5366979zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

inductionreverse mathematicscomputable model theorygenericshomogeneous modelsatomic modelsboundinguniform reductionAMTWeihrauchATTFATTHMT

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3670442 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1302870 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• scientific article; zbMATH DE number 3437136 (Why is no real title available?)
• scientific article; zbMATH DE number 2236640 (Why is no real title available?)
• A characterization of the \(0\)-basis homogeneous bounding degrees
• Bounding homogenous models
• Bounding prime models
• Classifying model-theoretic properties
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Computability of homogeneous models
• Computable structures and the hyperarithmetical hierarchy
• Decidable models
• Degree spectra of prime models
• Finite injury and Σ₁-induction
• Higher set theory and mathematical practice
• Homogeneous models and decidability
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
• Model Theory
• Model theory.
• Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
• On notions of computability-theoretic reduction between Π21 principles
• On the Equimorphism Types of Linear Orderings
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• On uniform relationships between combinatorial problems
• Open questions in reverse mathematics
• Periodic points and subsystems of second-order arithmetic
• Recursively presentable prime models
• Reverse mathematics of first-order theories with finitely many models
• Reverse mathematics, countable and uncountable
• Reverse mathematics: the playground of logic
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Splitting an α-Recursively Enumerable Set
• Strong constructivizability of homogeneous models
• Subsystems of second order arithmetic
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• The atomic model theorem and type omitting
• The degree spectra of homogeneous models
• The strength of Turing determinacy within second order arithmetic
• \(\mathsf{WKL}_0\) and induction principles in model theory
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction

Cited in

(5)

• ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
• A note on decidable categoricity and index sets
• \(\mathsf{WKL}_0\) and induction principles in model theory
• Primitive recursive reverse mathematics
• On notions of computability-theoretic reduction between Π21 principles

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)