Strong constructivizability of homogeneous models

DOI10.1007/BF01674776zbMath0441.03015MaRDI QIDQ1142774

Sergei S. Goncharov

Publication date: 1979

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

zbMATH Keywords

decidable theoryprime modeldenumerable homogeneous modelsexistence of strongly constructivizable models

Mathematics Subject Classification ID

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

Related Items (11)

A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces ⋮ Minimal coorder of pseudo-Boolean and topo-Boolean algebras having no finite basis of quasi-identities ⋮ On Decidable and Computable Models of Theories ⋮ Computable models of theories with few models ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ A note on decidable categoricity and index sets ⋮ Autostability of prime models under strong constructivizations ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Hanf number for Scott sentences of computable structures ⋮ Finite lattices having no independent basis of quasiidentities ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory

Cites Work

• Decidable models
• Some aspects of generalized computability
• Recursively presentable prime models
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong constructivizability of homogeneous models