Bounding prime models
From MaRDI portal
Publication:5311770
DOI10.2178/jsl/1102022214zbMath1071.03021MaRDI 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
03C57: Computable structure theory, computable model theory
Related Items
RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION, Thin set theorems and cone avoidance, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, Degree spectra of prime models, Any FIP real computes a 1-generic, Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem, Array nonrecursiveness and relative recursive enumerability, On the strength of the finite intersection principle, Effectively categorical abelian groups, Limitwise monotonic sequences and degree spectra of structures, Iterated effective embeddings of abelian p-groups, Computable trees, prime models, and relative decidability, The atomic model theorem and type omitting
Cites Work
