The α-finite injury method

&
Annals of Mathematical Logic 4 (4):343-367 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(72)90004-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

An α-finite injury method of the unbounded type.C. T. Chong - 1976 - Journal of Symbolic Logic 41 (1):1-17.
Ge Sacks and sg Simpson [1972] the oz-finite injury method, Ann. Math. Logic, 4, pp. 323-367.M. Magidor, S. Shelah, J. Stavi, M. Mytilinaios, Ta Slaman, Jb Paris & H. la KirbyRogers Jr - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 299.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Mathematical Logic Quarterly 38 (1):189-195.
Selected logic papers.Gerald E. Sacks - 1999 - River Edge, N.J.: World Scientific.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
A. H. Lachlan. On a problem of G. E. Sacks. Proceedings of the American Mathematical Society, vol. 16 , pp. 972–979.Gustav B. Hensel - 1967 - Journal of Symbolic Logic 32 (1):125.
Stephen G. Simpson. Nonprovability of certain combinatorial properties of finite trees. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 87–117. , pp. 45–65.). [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
Finite injury arguments in infinite computation theories.Viggo Stoltenberg-Hansen - 1979 - Annals of Mathematical Logic 16 (1):57-80.

Analytics

Added to PP
2014-01-17

Downloads
18 (#828,363)

6 months
4 (#1,006,062)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Adding a closed unbounded set.J. E. Baumgartner, L. A. Harrington & E. M. Kleinberg - 1976 - Journal of Symbolic Logic 41 (2):481-482.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.

View all 33 citations / Add more citations

References found in this work

The Consistency of the Continuum Hypothesis.Kurt Godel - 1940 - Princeton University Press.
Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
Some Reasons for Generalizing Recursion Theory.G. Kreisel, R. O. Gandy & C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.

View all 11 references / Add more references