A new spectrum of computable models
The paper contains a survey of results concerning computable models of the so called Ehrenfeucht theories, i.e., complete theories having a finite number (at least two) of countable models up to isomorphism. A new result is the following Theorem 9: Let \(n\) an \(m\) be natural numbers such that \(1\leq m\leq n\). Then, there exists an Ehrenfeucht theory \(T\) such that {\parindent=6.5mm \begin{itemize}\item[(1)] \(T\) has exactly \(n+2\) nonisomorphic countable models; \item[(2)] \(T\) has \(n\) nonisomorphic almost prime models \({\mathfrak A}_1,\dots,{\mathfrak A}_n\) which are mutually elementary embeddable; and \item[(3)] the models \({\mathfrak A}_1,\dots,{\mathfrak A}_m\) are computable and the models \({\mathfrak A}_{m+1},\dots,{\mathfrak A}_n\) are not computable. \end{itemize}}
- On spectra of computable models
- New Models of Computation
- Computable Models
- Computable Models
- Computability in special models
- Computability and computable models
- Models and computability
- A new spectrum of recursive models
- Computability of homogeneous models
- Spectra of computable models for Ehrenfeucht theories
- Computable models of theories with few models
- On spectra of computable models
- On constructive models of theories with linear Rudin-Keisler ordering
- Spectra of computable models for Ehrenfeucht theories
- On the Computational Capabilities of Several Models
- scientific article; zbMATH DE number 3914293 (Why is no real title available?)
- Finite extensions and the number of countable models
- scientific article; zbMATH DE number 1390025 (Why is no real title available?)
- A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
This page was built for publication: A new spectrum of computable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943912)
