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

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


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



    Upload a copy of this work     Papers currently archived: 91,349

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

Index sets in Ershov's hierarchy.Jacques Grassin - 1974 - Journal of Symbolic Logic 39 (1):97-104.
Group Structural Realism.Bryan W. Roberts - 2011 - British Journal for the Philosophy of Science 62 (1):47-69.
A hierarchy of families of recursively enumerable degrees.Lawrence V. Welch - 1984 - Journal of Symbolic Logic 49 (4):1160-1170.
The Hierarchy of System Specifications and the Problem of Structural Inference.Bernard P. Zeigler - 1976 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1976:227 - 239.
Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.


Added to PP

30 (#519,519)

6 months
3 (#992,474)

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