Recursively presentable prime models
From MaRDI portal
Publication:4096938
DOI10.2307/2272643zbMath0332.02055MaRDI QIDQ4096938
Publication date: 1974
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272643
03C60: Model-theoretic algebra
03B25: Decidability of theories and sets of sentences
03D99: Computability and recursion theory
03C68: Other classical first-order model theory
Related Items
On the computability-theoretic complexity of trivial, strongly minimal models, On Decidable and Computable Models of Theories, Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy, Computing constraint sets for differential fields, Generalizing classical and effective model theory in theories of operations and classes, On two problems of Turing complexity for strongly minimal theories, Turing machine computations in finitely axiomatizable theories, Connection between constructivizibility and strong constructivizibility for different classes of Abelian groups, Criterion for strong constructivizability of a homogeneous model, Strong constructivizability of homogeneous models, A totally transcendental decidable theory without constructivizable homogeneous models, The model theory of differential fields revisited, Decidable models, Computable models of theories with few models, From automatic structures to automatic groups., An uncountably categorical theory whose only computably presentable model is saturated, Degrees of autostability relative to strong constructivizations, The degrees of categorical theories with recursive models, RELATIVE TO ANY NON-HYPERARITHMETIC SET, Adapting Rabin’s Theorem for Differential Fields, Computable trees, prime models, and relative decidability, The atomic model theorem and type omitting, Type Structure Complexity and Decidability
Cites Work
