The Role of True Finiteness in the Admissible Recursively Enumerable Degrees

Cached

Download Links

by Noam Greenberg
Venue:Memoirs of the American Mathematical Society
Citations:1 - 1 self

Active Bibliography

2 The theory of the metarecursively enumerable degrees – Noam Greenberg, Richard A. Shore, Theodore, A. Slaman
4 Conjectures and Questions from Gerald Sacks’s Degrees of Unsolvability – Richard A. Shore - 1993
32 Computability and recursion – Robert I. Soare - 1996
6 The recursively enumerable degrees – Richard A. Shore - 1996
Computability Theory, Algorithmic Randomness and Turing’s Anticipation – Rod Downey
8 Totally ω-computably enumerable degrees and bounding critical triples, preprint – Rod Downey, Noam Greenberg, Rebecca Weber
5 The history and concept of computability – Robert I. Soare - 1999
34 Parameter Definability in the Recursively Enumerable Degrees – Andre Nies
Transfinite Machine Models – P. D. Welch - 2011
1 Differences between Resource Bounded Degree Structures – Michael E. Mytilinaios, Theodore A. Slaman
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
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
2 BARWISE: INFINITARY LOGIC AND ADMISSIBLE SETS – H. Jerome, Keisler, Julia F. Knight
Discrete transfinite computation models – P. D. Welch
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
8 Inductive Inference with Procrastination: Back to Definitions – Andris Ambainis, Rusins Freivalds, Carl H. Smith - 1999
Mathematical incompleteness and objectively guided intrinsic values – Paul Budnik