Recursively presentable prime models

DOI10.2307/2272643MaRDI QIDQ4096938zbMATH OpenOpenAlexFDO

Authors Leo Harrington

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model-theoretic algebra (03C60) Other classical first-order model theory (03C68) Computability and recursion theory (03D99)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• The Picard group of noncommutative rings, in particular of orders

Cited in

(37)

• 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.
• A note on decidable categoricity and index sets
• A.D. Taimanov and model theory in Kazakhstan
• 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
• Some Questions in Computable Mathematics
• 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
• Computing constraint sets for differential fields
• Independence in computable algebra
• A geometric model of an arbitrary differentially closed field of characteristic zero
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Algebraic structures computable without delay
• On the computability-theoretic complexity of trivial, strongly minimal models
• On decidable and computable models of theories
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• Primitive recursive reverse mathematics
• Punctually presented structures I: Closure theorems
• Computably and punctually universal spaces
• Complexity estimates for theories of some classes of prime models
• The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
• Generalizing classical and effective model theory in theories of operations and classes
• On two problems of Turing complexity for strongly minimal theories

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)