Recursively presentable prime models
From MaRDI portal
Publication:4096938
DOI10.2307/2272643zbMath0332.02055OpenAlexW2084068730MaRDI 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
Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Computability and recursion theory (03D99) Other classical first-order model theory (03C68)
Related Items (35)
On the computability-theoretic complexity of trivial, strongly minimal models ⋮ On Decidable and Computable Models of Theories ⋮ Computable models of theories with few models ⋮ Primitive recursive reverse mathematics ⋮ Computing constraint sets for differential fields ⋮ Criterion for strong constructivizability of a homogeneous model ⋮ Strong constructivizability of homogeneous models ⋮ Punctually presented structures I: Closure theorems ⋮ A note on decidable categoricity and index sets ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ A totally transcendental decidable theory without constructivizable homogeneous models ⋮ Some Questions in Computable Mathematics ⋮ Type Structure Complexity and Decidability ⋮ A geometric model of an arbitrary differentially closed field of characteristic zero ⋮ Independence in computable algebra ⋮ Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy ⋮ On two problems of Turing complexity for strongly minimal theories ⋮ Algebraic structures computable without delay ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ From automatic structures to automatic groups. ⋮ The model theory of differential fields revisited ⋮ An uncountably categorical theory whose only computably presentable model is saturated ⋮ Decidable models ⋮ Degrees of autostability relative to strong constructivizations ⋮ Computable trees, prime models, and relative decidability ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ Adapting Rabin’s Theorem for Differential Fields ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ The atomic model theorem and type omitting ⋮ The degrees of categorical theories with recursive models ⋮ The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET ⋮ Turing machine computations in finitely axiomatizable theories ⋮ Generalizing classical and effective model theory in theories of operations and classes ⋮ Connection between constructivizibility and strong constructivizibility for different classes of Abelian groups
Cites Work
This page was built for publication: Recursively presentable prime models
