Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/iterated-trees-of-strategies-and-priority-arguments-rgojPKQejX
References (21)
-
S. Lempp, M. Lerman (1996)
The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump RelationsAdvances in Mathematics, 120
-
(1987)
Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic -
S. Lempp, M. Lerman (1992)
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibilityJournal of Symbolic Logic, 57
-
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
-
R. Epstein (1979)
Degrees of Unsolvability: Structure and Theory -
Hinman, n-r.e. and n-REA sets, private communication -
Foundations of the Priority Method, I: Finite and infinite injury -
(1957)
Nat. Acad. Sci. U.S.A -
T. Slaman (1991)
The Density of Infima in the Recursively Enumerable DegreesAnn. Pure Appl. Log., 52
-
A. Lachlan (1966)
Lower Bounds for Pairs of Recursively Enumerable DegreesProceedings of The London Mathematical Society
-
LL2] Minimal pairs of r.e. degrees and iterated trees of strategies -
S. Lempp, M. Lerman (1990)
Priority arguments using iterated trees of strategies -
S. Cooper (1971)
Degrees of Unsolvability -
(1963)
Ann. Math. Studies no -
(1956)
On the unsolvability of the problem of reducibility in the theory of algorithms -
A. Lachlan (1979)
Bounding minimal pairsJournal of Symbolic Logic, 44
-
C. Yates (1966)
A minimal pair of recursively enumerable degreesJournal of Symbolic Logic, 31
-
C. Ash (1990)
Labelling Systems and r.e. StructuresAnn. Pure Appl. Log., 47
-
S. Lempp, M. Lerman, M. Ash, L. Groszek, J. Harrington, A. Knight, R. Kučera (1998)
The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump Relations -
The decidability of existential theory of the poset of recursively enumerable degrees with jump relations , to appear -
Richard Friedberg (1957)
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944).Proceedings of the National Academy of Sciences of the United States of America, 43 2
- Publisher
- Springer Journals
- Copyright
- Copyright © 1997 by Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s001530050067
- Publisher site
- See Article on Publisher Site
Abstract
We describe the motivation for the construction of a general framework for priority arguments, the ideas incorporated into the construction of the framework, and the use of the framework to prove theorems in computability theory which require priority arguments.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Aug 1, 1997