Turing Computability pp 221-224 | Cite as
More Lachlan Games
Chapter
First Online:
Abstract
With the Kleene-Post [1954] paper on oracle constructions presented in Chapter 6, and the finite injury computable approximations to them in Friedberg [1957] and Muchnik [1956] presented in Chapter 7, constructions in computability entered a new and much more complicated phase in the 1960s. Shoenfield [1961] and independently Sacks [1963a, 1963c, and 1964a] invented the infinite injury method for constructing c.e. sets and degrees.
Keywords
Computability Theory Winning Strategy Measurable Cardinal Minimal Pair Game Theory Model
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag Berlin Heidelberg 2016