On Σ₁-Structural Differences among Finite Levels of the Ershov Hierarchy

Journal of Symbolic Logic 71 (4):1223 - 1236 (2006)
  Copy   BIBTEX

Abstract

We show that the structure R of recursively enumerable degrees is not a Σ₁-elementary substructure of Dn, where Dn (n > 1) is the structure of n-r.e. degrees in the Ershov hierarchy

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,874

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

On Transfinite Levels of the Ershov Hierarchy.Cheng Peng - 2021 - Bulletin of Symbolic Logic 27 (2):220-221.
Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
Normalizing notations in the Ershov hierarchy.Cheng Peng - 2021 - Mathematical Logic Quarterly 67 (4):506-513.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
Generalized cohesiveness.Tamara Hummel & Carl Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.

Analytics

Added to PP
2010-08-24

Downloads
41 (#527,608)

6 months
10 (#367,827)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

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

Add more references