The atomic model theorem and type omitting

DOI10.1090/S0002-9947-09-04847-8zbMath1184.03005OpenAlexW2023021577MaRDI QIDQ3642694

Denis R. Hirschfeldt, Theodore A. Slaman, Richard A. Shore

Publication date: 6 November 2009

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-09-04847-8

zbMATH Keywords

reverse mathematicsprime modelsomitting typesatomic modelscomplexity of model-theoretic theorems

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items

Reverse Mathematics: The Playground of Logic, Refining the taming of the reverse mathematics zoo, On the uniform computational content of the Baire category theorem, Reduction games, provability and compactness, THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, Iterative Forcing and Hyperimmunity in Reverse Mathematics, Dominating the Erdős-Moser theorem in reverse mathematics, The reverse mathematics of non-decreasing subsequences, On the strength of the finite intersection principle, Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles, OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS, Any FIP real computes a 1-generic, Primitive recursive reverse mathematics, Infinite dimensional proper subspaces of computable vector spaces, Effective prime uniqueness, The thin set theorem for pairs implies DNR, ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, The finite intersection principle and genericity, Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem, \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs, Weakly Represented Families in Reverse Mathematics, Strength and Weakness in Computable Structure Theory, THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES, Baire categoricity and \(\Sigma_1^0\)-induction, HENKIN CONSTRUCTIONS OF MODELS WITH SIZE CONTINUUM, Degrees bounding principles and universal instances in reverse mathematics, SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS, On the logical strengths of partial solutions to mathematical problems, A characterization of the 0-basis homogeneous bounding degrees, Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees, Cohesive avoidance and strong reductions, \(\mathsf{WKL}_0\) and induction principles in model theory

Cites Work

• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Model theory
• Interpolation and embedding in the recursively enumerable degrees
• On the strength of Ramsey's theorem for pairs
• Infinite chains and antichains in computable partial Orderings
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Computable trees, prime models, and relative decidability
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Classifying model-theoretic properties
• Omitting types, type spectrums, and decidability
• Foundations of recursive model theory
• Splitting an α-Recursively Enumerable Set
• Recursively presentable prime models
• A cohesive set which is not high
• Jump equivalence of the Δ₂⁰ hyperimmune sets
• Degree spectra of prime models
• Bounding prime models
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item