The n-r.E. Degrees: Undecidability and σ1 substructures

Journal of Mathematical Logic 12 (1):1250005- (2012)
  Copy   BIBTEX

Abstract

We study the global properties of [Formula: see text], the Turing degrees of the n-r.e. sets. In Theorem 1.5, we show that the first order of [Formula: see text] is not decidable. In Theorem 1.6, we show that for any two n and m with n < m, [Formula: see text] is not a Σ1-substructure of [Formula: see text].

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

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

Galois-stability for Tame abstract elementary classes.Rami Grossberg & Monica Vandieren - 2006 - Journal of Mathematical Logic 6 (01):25-48.
Degrees of categoricity and treeable degrees.Barbara F. Csima & Dino Rossegger - forthcoming - Journal of Mathematical Logic.
On model-theoretic tree properties.Artem Chernikov & Nicholas Ramsey - 2016 - Journal of Mathematical Logic 16 (2):1650009.

Analytics

Added to PP
2012-07-07

Downloads
103 (#166,867)

6 months
10 (#383,927)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Isolated maximal d.r.e. degrees.Yong Liu - 2019 - Annals of Pure and Applied Logic 170 (4):515-538.

Add more citations

References found in this work

Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.
Systems of Logic Based on Ordinals.Andrzej Mostowski - 1939 - Journal of Symbolic Logic 4 (3):128-129.
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.

View all 18 references / Add more references