Abstract
We construct an example of a theory with a finite (greater than one) number of isomorphism types of countable models such that its prime and saturated models have computable presentations and there exists a model which lacks in such.
- Record Identifier
- 9926529307901891
- Title
- Spectra of computable models for Ehrenfeucht theories
- Creators
- A. N. Gavryushkin
- Publication Details
- Algebra and logic, Vol.46(3), pp.149-157
- Academic Unit
- Computer Science
- Publisher
- Springer Nature
- Date published ; e-published
- 01/05/2007
- Language
- English
- Resource Type; Subtype
- Journal article