Bounding prime models
From MaRDI portal
Recommendations
Cites work
- Computable structures and the hyperarithmetical hierarchy
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3401261 (Why is no real title available?)
- scientific article; zbMATH DE number 3090999 (Why is no real title available?)
- Prime models of theories of computable linear orderings
Cited in
(14)- 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
- Classifying model-theoretic properties
- The atomic model theorem and type omitting
- On the strength of the finite intersection principle
- 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
This page was built for publication: Bounding prime models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311770)