Degree Spectra of Prime Models

Journal of Symbolic Logic 69 (2):430 - 442 (2004)
  Copy   BIBTEX

Abstract

We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 0, T has a d-decidable model omitting the nonprincipal types listed by L

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
A complete, decidable theory with two decidable models.Terrence S. Millar - 1979 - Journal of Symbolic Logic 44 (3):307-312.
The completeness of S.Harry Deutsch - 1979 - Studia Logica 38 (2):137 - 147.
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
On the number of minimal models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):475-480.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
Prime numbers and factorization in IE1 and weaker systems.Stuart T. Smith - 1992 - Journal of Symbolic Logic 57 (3):1057 - 1085.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.
On uniqueness of prime models.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (2):215-220.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.

Analytics

Added to PP
2010-08-24

Downloads
33 (#488,210)

6 months
3 (#984,212)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A characterization of the 0 -basis homogeneous bounding degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
Computability of Homogeneous Models.Karen Lange & Robert I. Soare - 2007 - Notre Dame Journal of Formal Logic 48 (1):143-170.

Add more citations

References found in this work

Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.

Add more references