|
2
|
The theory of the metarecursively enumerable degrees
– Noam Greenberg, Richard A. Shore, Theodore, A. Slaman
|
|
3
|
Conjectures and Questions from Gerald Sacks’s Degrees of Unsolvability
– Richard A. Shore
- 1993
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
7
|
The recursively enumerable degrees
– Richard A. Shore
- 1996
|
|
5
|
Totally ω-computably enumerable degrees and bounding critical triples, preprint
– Rod Downey, Noam Greenberg, Rebecca Weber
|
|
30
|
Parameter Definability in the Recursively Enumerable Degrees
– Andre Nies
|
|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
|
TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES
– Peter A. Cholak, Stephen M. Walk
- 1999
|
|
4
|
Intervals without critical triples
– Peter Cholak, Rod Downey, Richard Shore
- 1998
|
|
2
|
Differences between Resource Bounded Degree Structures
– Michael E. Mytilinaios, Theodore A. Slaman
|
|
|
Discrete transfinite computation models
– P. D. Welch
|
|
1
|
BARWISE: INFINITARY LOGIC AND ADMISSIBLE SETS
– H. Jerome, Keisler, Julia F. Knight
|
|
8
|
Inductive Inference with Procrastination: Back to Definitions
– Andris Ambainis, Rusins Freivalds, Carl H. Smith
- 1999
|
|
1
|
Embedding Distributive Lattices Preserving 1 Below a Nonzero Recursively Enumerable Turing Degree
– Klaus Ambos-Spies, Ding Decheng, Peter A. Fejer
|
|
2
|
On Lachlan's major subdegree problem, to
– S. Barry Cooper, Leeds Ls Jt, Angsheng Li
- 1989
|
|
1
|
The ∀∃-theory of R(≤, ∨, ∧) is undecidable
– Russell G. Miller, Andre O. Nies, Richard, A. Shore
- 2004
|
|
2
|
2004], The 89-theory of R( ; _; ^) is undecidable
– Andre O. Nies, Richard A. Shore
|
|
1
|
Abstract
– Cristopher Moore, Alexander Russell
|
|
|
Lambda-Calculus and Functional Programming
– Jonathan P. Seldin
|
