The limits of "E"-recursive enumerability

Annals of Pure and Applied Logic 31:87 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(86)90064-3

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
Relative Recursive Enumerability of Generic Degrees.Masahiro Kumabe - 1991 - Journal of Symbolic Logic 56 (3):1075-1084.
Relative recursive enumerability of generic degrees.Masahiro Kumabe - 1991 - Journal of Symbolic Logic 56 (3):1075-1084.
Array nonrecursiveness and relative recursive enumerability.Mingzhong Cai - 2012 - Journal of Symbolic Logic 77 (1):21-32.
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
Effective Enumerability of Some Families of Partially Recursive Functions Connected With Computable Functionals.Vladeta Vučković - 1970 - Mathematical Logic Quarterly 16 (2):113-121.
Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):49-62.
Compactness and recursive enumerability in intensional logic.Bernd J. Stephan - 1975 - Mathematical Logic Quarterly 21 (1):343-346.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
Iterated relative recursive enumerability.Peter A. Cholak & Peter G. Hinman - 1994 - Archive for Mathematical Logic 33 (5):321-346.
Stability among r.e. quotient algebras.John Love - 1993 - Annals of Pure and Applied Logic 59 (1):55-63.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.

Analytics

Added to PP
2017-02-19

Downloads
2 (#1,799,720)

6 months
2 (#1,193,798)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Effective forcing versus proper forcing.Gerald E. Sacks - 1996 - Annals of Pure and Applied Logic 81 (1-3):171-185.

Add more citations

References found in this work

On the Singular Cardinals problem.Jack Silver, Fred Galvin, Keith J. Devlin & R. B. Jensen - 1981 - Journal of Symbolic Logic 46 (4):864-866.
Σ1 compactness for next admissible sets.Judy Green - 1974 - Journal of Symbolic Logic 39 (1):105 - 116.
$Sigma_1$ Compactness for Next Admissible Sets.Judy Green - 1974 - Journal of Symbolic Logic 39 (1):105-116.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.

Add more references