Bounding prime models

DOI10.2178/jsl/1102022214zbMath1071.03021OpenAlexW2134024760MaRDI QIDQ5311770

Robert I. Soare, Denis R. Hirschfeldt, Julia F. Knight, Barbara F. Csima

Publication date: 29 August 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1102022214

zbMATH Keywords

prime modelcomputable model theorycomplete atomic decidable theoryprime bounding sets

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items

Effectively categorical abelian groups ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Degree spectra of prime models ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ On the strength of the finite intersection principle ⋮ Iterated effective embeddings of abelian p-groups ⋮ Any FIP real computes a 1-generic ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Array nonrecursiveness and relative recursive enumerability ⋮ Computable trees, prime models, and relative decidability ⋮ Thin set theorems and cone avoidance ⋮ The atomic model theorem and type omitting ⋮ Limitwise monotonic sequences and degree spectra of structures

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Prime models of theories of computable linear orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item