Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

DOI10.1090/memo/1187zbMath1406.03039OpenAlexW2534696914MaRDI QIDQ5366979

Richard A. Shore, Karen Lange, Denis R. Hirschfeldt

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

genericsinductionreverse mathematicscomputable model theoryhomogeneous modelsatomic modelsboundinguniform reductionAMTWeihrauchATTFATTHMT

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Basic properties of first-order languages and structures (03C07) Model theory of denumerable and separable structures (03C15)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability of homogeneous models
• Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
• Strong constructivizability of homogeneous models
• Homogeneous models and decidability
• Model theory.
• Decidable models
• Computable structures and the hyperarithmetical hierarchy
• On the strength of Ramsey's theorem
• \(\mathsf{WKL}_0\) and induction principles in model theory
• Periodic points and subsystems of second-order arithmetic
• On the strength of Ramsey's theorem for pairs
• The strength of Turing determinacy within second order arithmetic
• On uniform relationships between combinatorial problems
• REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS
• Necessary use of induction in a reversal
• Reverse Mathematics: The Playground of Logic
• Open Questions in Reverse Mathematics
• On notions of computability-theoretic reduction between Π21 principles
• Slicing the Truth
• THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Bounding homogenous models
• On the Equimorphism Types of Linear Orderings
• Classifying model-theoretic properties
• The degree spectra of homogeneous models
• The atomic model theorem and type omitting
• Finite injury and Σ₁-induction
• Splitting an α-Recursively Enumerable Set
• Recursively presentable prime models
• Model Theory
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• A characterization of the 0-basis homogeneous bounding degrees
• Degree spectra of prime models
• Bounding prime models
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Higher set theory and mathematical practice

This page was built for publication: Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem