Degree Spectra of Prime Models

Journal of Symbolic Logic 69 (2):430 - 442 (2004)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,561
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Harry Deutsch (1979). The Completeness of S. Studia Logica 38 (2):137 - 147.
Saharon Shelah (1978). On the Number of Minimal Models. Journal of Symbolic Logic 43 (3):475-480.
Saharon Shelah (1979). On Uniqueness of Prime Models. Journal of Symbolic Logic 44 (2):215-220.
Analytics

Monthly downloads

Added to index

2010-08-24

Total downloads

8 ( #167,632 of 1,098,129 )

Recent downloads (6 months)

1 ( #283,897 of 1,098,129 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.