A totally transcendental decidable theory without constructivizable homogeneous models

DOI10.1007/BF01669834zbMath0468.03024OpenAlexW1982321417MaRDI 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 constructivizabilityrecursive model theoryexistence problem for strongly constructivizable homogeneous models

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models with special properties (saturated, rigid, etc.) (03C50) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)

Cites Work

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

This page was built for publication: A totally transcendental decidable theory without constructivizable homogeneous models