Number of constructive homogeneous models of a complete decidable theory (Q792316): Difference between revisions

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.