Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/degree-spectra-of-the-successor-relation-of-computable-linear-HPZ7Xt7Qb8
References (15)
-
P. Odifreddi (1989)
Classical recursion theory -
Countably Complementable (2006)
LINEAR ORDERINGS -
R. Downey (1993)
Every Recursive Boolean Algebra is Isomorphic to One with Incomplete AtomsAnn. Pure Appl. Log., 60
-
J. Remmel (1981)
Recursive isomorphism types of recursive Boolean algebrasJournal of Symbolic Logic, 46
-
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
-
(1987)
Degree Spectrum of a Recursive Relation on a Recursive Structure -
S. Goncharov, V. Dzgoev (1980)
Autostability of modelsAlgebra and Logic, 19
-
(2005)
jchubb@gwu.edu Department of Mechanics and Mathematics -
R. Downey, D. Hirschfeldt, B. Khoussainov (2001)
Uniformity in Computable Structure TheoryAlgebra and Logic, 42
-
R. Downey, Michael Moses (1991)
Recursive linear orders with incomplete successivitiesTransactions of the American Mathematical Society, 326
-
R. Soare (1987)
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets -
V. Harizanov (1991)
Some Effects of Ash-Nerode and Other Decidability Conditions on Degree SpectraAnn. Pure Appl. Log., 55
-
C. Ash, J. Knight (2000)
Computable structures and the hyperarithmetical hierarchy -
S. Goncharov, R. Downey, D. Hirschfeldt (2003)
Degree Spectra of Relations on Boolean AlgebrasAlgebra and Logic, 42
-
J. Remmel (1981)
Recursively categorical linear orderings, 83
- Publisher
- Springer Journals
- Copyright
- Copyright © 2008 by Springer-Verlag
- Subject
- Mathematics; Algebra; Mathematics, general; Mathematical Logic and Foundations
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-008-0110-6
- Publisher site
- See Article on Publisher Site
Abstract
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Dec 12, 2008