Criterion for strong constructivizability of a homogeneous model

DOI10.1007/BF01674780MaRDI QIDQ1140632zbMATH OpenOpenAlexFDO

Authors 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) Models of other mathematical theories (03C65) Computability and recursion theory (03D99)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3382339 (Why is no real title available?)
• Decidable models
• Recursively presentable prime models
• Some aspects of generalized computability

Cited in

(3)

• A note on decidable categoricity and index sets
• On decidable and computable models of theories
• Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140632)