Ge Sacks and sg Simpson [1972] the oz-finite injury method, Ann. Math. Logic, 4, pp. 323-367

, , , , , &
In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 299 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
Embedding FD(ω) into {mathcal{P}_s} densely.Joshua A. Cole - 2008 - Archive for Mathematical Logic 46 (7-8):649-664.
Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Mathematical Logic Quarterly 38 (1):189-195.
Ω in number theory.Toby Ord - 2007 - In C. S. Calude (ed.), Randomness and Complexity, from Leibniz to Chaitin. World Scientific. pp. 161-173.
More about λ-support iterations of (<λ)-complete forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2013 - Archive for Mathematical Logic 52 (5-6):603-629.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
A Sacks real out of nowhere.Jakob Kellner & Saharon Shelah - 2010 - Journal of Symbolic Logic 75 (1):51-76.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
An α-finite injury method of the unbounded type.C. T. Chong - 1976 - Journal of Symbolic Logic 41 (1):1-17.
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
The Medvedev lattice of computably closed sets.Sebastiaan A. Terwijn - 2006 - Archive for Mathematical Logic 45 (2):179-190.

Analytics

Added to PP
2014-01-27

Downloads
11 (#1,105,752)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references