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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Configure |
Similar books and articlesBarbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare (2004). Bounding Prime Models. Journal of Symbolic Logic 69 (4):1117 - 1142.
Denis R. Hirschfeldt (2002). Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms. Journal of Symbolic Logic 67 (2):697 - 720.
Denis R. Hirschfeldt (2002). Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms. Journal of Symbolic Logic 67 (2):697 - 720.
Terrence S. Millar (1979). A Complete, Decidable Theory with Two Decidable Models. Journal of Symbolic Logic 44 (3):307-312.
Harry Deutsch (1979). The Completeness of S. Studia Logica 38 (2):137 - 147.
Douglas Cenzer & Jeffrey B. Remmel (2006). Complexity, Decidability and Completeness. Journal of Symbolic Logic 71 (2):399 - 424.
Saharon Shelah (1978). On the Number of Minimal Models. Journal of Symbolic Logic 43 (3):475-480.
Françoise Maurin (1997). The Theory of Integer Multiplication with Order Restricted to Primes is Decidable. Journal of Symbolic Logic 62 (1):123-130.
Olivier Lessmann (2003). Categoricity and U-Rank in Excellent Classes. Journal of Symbolic Logic 68 (4):1317-1336.
Anand Pillay (1994). Definability of Types, and Pairs of o-Minimal Structures. Journal of Symbolic Logic 59 (4):1400-1409.
Stuart T. Smith (1992). Prime Numbers and Factorization in IE1 and Weaker Systems. Journal of Symbolic Logic 57 (3):1057 - 1085.
Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore (2013). Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame Journal of Formal Logic 54 (2):215-231.
Anand Pillay & Charles Steinhorn (1987). On Dedekind Complete o-Minimal Structures. Journal of Symbolic Logic 52 (1):156-164.
Saharon Shelah (1979). On Uniqueness of Prime Models. Journal of Symbolic Logic 44 (2):215-220.
M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads7 ( #133,479 of 549,087 )Recent downloads (6 months)6 ( #12,372 of 549,087 )How can I increase my downloads? |
My notes
Discussion
