Criterion for strong constructivizability of a homogeneous model

DOI10.1007/BF01674780zbMath0436.03030OpenAlexW2065230732MaRDI QIDQ1140632

Mikhaĭl G. Peretyat'kin

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1007/bf01674780

zbMATH Keywords

constructive modelsstrong constructibilityhomogeneous modelstypes of a first-order theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Computability and recursion theory (03D99) Models of other mathematical theories (03C65)

Related Items (3)

On Decidable and Computable Models of Theories ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ A note on decidable categoricity and index sets

Cites Work

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

This page was built for publication: Criterion for strong constructivizability of a homogeneous model