Recursively presentable prime models
From MaRDI portal
Publication:4096938
Cites work
Cited in
(36)- The model theory of differential fields revisited
- Strong constructivizability of homogeneous models
- The degrees of categorical theories with recursive models
- The atomic model theorem and type omitting
- Punctually presented structures I: Closure theorems
- Degrees of autostability relative to strong constructivizations
- A note on decidable categoricity and index sets
- A.D. Taimanov and model theory in Kazakhstan
- Turing machine computations in finitely axiomatizable theories
- On two problems of Turing complexity for strongly minimal theories
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy
- The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
- On decidable and computable models of theories
- Computably and punctually universal spaces
- Criterion for strong constructivizability of a homogeneous model
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Computing constraint sets for differential fields
- Computable trees, prime models, and relative decidability
- Adapting Rabin's theorem for differential fields
- Some Questions in Computable Mathematics
- Connection between constructivizibility and strong constructivizibility for different classes of Abelian groups
- Generalizing classical and effective model theory in theories of operations and classes
- A geometric model of an arbitrary differentially closed field of characteristic zero
- Decidable models
- Computable models of theories with few models
- A totally transcendental decidable theory without constructivizable homogeneous models
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- An uncountably categorical theory whose only computably presentable model is saturated
- Type Structure Complexity and Decidability
- Independence in computable algebra
- Relative to any non-hyperarithmetic set
- Algebraic structures computable without delay
- From automatic structures to automatic groups.
- On the computability-theoretic complexity of trivial, strongly minimal models
- Primitive recursive reverse mathematics
This page was built for publication: Recursively presentable prime models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096938)