Searching for authors named Peter Cholak – sorted by Relevance.
-
LECTURES ON EFFECTIVE RANDOMNESS Wednesday, August 23
- LECTURES ON EFFECTIVE RANDOMNESS Wednesday, August 23 PETER CHOLAK 1. Introduction This class
- Add To MetaCart
-
Iterated Relative Recursive Enummmerability
- This paper is in the recent tradition of studying sets (of natural numbers) and (Turing) degrees which although not recursively enumerable (r.e.) are closely related to r.e. sets and degrees. ur starting point is the following pair of results.
- Add To MetaCart
-
The Global Structure of Computably Enumerable Sets
- Contemporary Mathematics The global structure of computably enumerable sets Peter A. Cholak
- Cited by 2 (1 self) – Add To MetaCart
-
Contemporary Mathematics The
- Contemporary Mathematics The global structure of computably enumerable sets Peter A. Cholak
- Add To MetaCart
-
Invariance And Noninvariance In The Lattice Of Pi Classes
- INVARIANCE AND NONINVARIANCE IN THE LATTICE OF \Pi 0 1 CLASSES Peter A. Cholak and Rod Downey We
- Add To MetaCart
-
Extension theorems, orbits, and automorphisms of the computably enumerable sets
- , AND AUTOMORPHISMS OF THE COMPUTABLY ENUMERABLE SETS PETER A. CHOLAK AND LEO A. HARRINGTON Abstract. We prove
- Cited by 4 (4 self) – Add To MetaCart
-
On the definability of the double jump in the computably enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS PETER A. CHOLAK AND LEO A
- Cited by 8 (5 self) – Add To MetaCart
-
Atomless r-Maximal Sets
- ATOMLESS r-MAXIMAL SETS PETER A. CHOLAK AND ANDR E NIES Abstract. We focus on L(A), the filter
- Cited by 2 (1 self) – Add To MetaCart
-
Definable encodings in the computably enumerable sets
- DEFINABLE ENCODINGS IN THE COMPUTABLY ENUMERABLE SETS PETER A. CHOLAK AND LEO A. HARRINGTON 1
- Cited by 6 (5 self) – Add To MetaCart
-
Iterated Relative Recursive Enumerability 1
- Iterated Relative Recursive Enumerability 1 by Peter A. Cholak 2 and Peter G. Hinman Draft of 30
- Add To MetaCart

