Notre Dame Journal of Formal Logic 51 (1):127-159 (2010)

We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been topics of interest in computability theory and continue to be a rich source of problems and ideas. In particular, we draw attention to the links and connections between these topics and explore their significance to modern research in the field
Keywords Pi01 classes   basis theorems   Peano arithmetic   randomness   computable domination   hyperimmunity
Categories (categorize this paper)
DOI 10.1215/00294527-2010-009
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,666
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (7-12):159-166.

Add more references

Citations of this work BETA

Antibasis Theorems for {\ Pi^ 0_1} Classes and the Jump Hierarchy.Ahmet Çevik - 2013 - Archive for Mathematical Logic 52 (1-2):137-142.
Choice Classes.Ahmet Çevik - 2016 - Mathematical Logic Quarterly 62 (6):563-574.

Add more citations

Similar books and articles

Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Models Without Indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
A Model of Peano Arithmetic with No Elementary End Extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
Model-Theoretic Properties Characterizing Peano Arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.
On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.


Added to PP index

Total views
26 ( #384,026 of 2,349,174 )

Recent downloads (6 months)
1 ( #511,414 of 2,349,174 )

How can I increase my downloads?


My notes