Recursively enumerable sets which are uniform for finite extensions

Journal of Symbolic Logic 36 (2):271-287 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270262

Links

PhilArchive



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

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

Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.
Review: Donald A. Martin, Classes of Recursively Enumerable Sets and Degrees of Unsolvability. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Simplicity of Recursively Enumerable Sets.Two Theorems on hyperhypersimple Sets.On the Lattice of Recursively Enumerable Sets.The Elementary Theory of Recursively Enumerable Sets.Robert W. Robinson & A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
On Some Games which are Relevant to the Theory of Recursively Enumerable Sets.A. H. Lachlan - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Ideals of Generalized Finite Sets in Lattices of α‐Recursively Enumerable Sets.Manuel Lerman - 1976 - Mathematical Logic Quarterly 22 (1):347-352.

Analytics

Added to PP
2009-01-28

Downloads
39 (#115,291)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21‐24):339-356.

Add more references