Translator Disclaimer
June 2004 Degree spectra of prime models
Barbara F. Csima
J. Symbolic Logic 69(2): 430-442 (June 2004). DOI: 10.2178/jsl/1082418536

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 < d0’, there is a prime model with elementary diagram of degree d. Indeed, this is a corollary of the fact that if T is a complete decidable theory and L is a computable set of c.e. partial types of T, then for any Δ02 degree d > 0, T has a d-decidable model omitting the nonprincipal types listed by L.

Citation

Download Citation

Barbara F. Csima. "Degree spectra of prime models." J. Symbolic Logic 69 (2) 430 - 442, June 2004. https://doi.org/10.2178/jsl/1082418536

Information

Published: June 2004
First available in Project Euclid: 19 April 2004

zbMATH: 1069.03025
MathSciNet: MR2058182
Digital Object Identifier: 10.2178/jsl/1082418536

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
13 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.69 • No. 2 • June 2004
Back to Top