A totally transcendental decidable theory without constructivizable homogeneous models

DOI10.1007/BF01669834zbMath0468.03024MaRDI QIDQ1156128

Sergei S. Goncharov

Publication date: 1981

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187088

zbMATH Keywords

strong constructivizability; recursive model theory; existence problem for strongly constructivizable homogeneous models

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03C50: Models with special properties (saturated, rigid, etc.)

03D45: Theory of numerations, effectively presented structures

03C15: Model theory of denumerable and separable structures

Cites Work

• Unnamed Item
• Some aspects of generalized computability
• Superatomic Boolean algebras
• Foundations of recursive model theory
• Recursively presentable prime models