Number of constructive homogeneous models of a complete decidable theory
A countable model M is called strongly constructivizable if under some presentation \(\nu:\omega \to M,\) the complete diagram of M becomes decidable. For every \(m\leq n\leq \omega\) a complete, decidable theory \(T_{n,m}\) is (uniformly) constructed. The signature of \(T_{n,m}\) consists of infinite families of unary and binary predicates. It is shown that \(T_{n,m}\) has exactly n strongly constructivizable models and exactly m of them are homogeneous. The nonhomogeneous models of \(T_{n,m}\) have no constructive homogeneous elementary extensions.
- Constructive homogeneous extensions
- The degree of decidable categoricity of a model with infinite solutions for complete formulas
- scientific article; zbMATH DE number 4016877 (Why is no real title available?)
- scientific article; zbMATH DE number 4164815 (Why is no real title available?)
- Bad models in nice neighborhoods
- Tame Theories with Hyperarithmetic Homogeneous Models
- scientific article; zbMATH DE number 4108740 (Why is no real title available?)
This page was built for publication: Number of constructive homogeneous models of a complete decidable theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792316)
