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. New York: 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: 93,069

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

Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
Review: M. Foreman, M. Magidor, S. Shelah, Martin's Maximum, Saturated Ideals, and Non-Regular Ultrafilters. Part I. [REVIEW]Boban Velickovic - 1992 - Journal of Symbolic Logic 57 (3):1131-1132.
Foreman M., Magidor M., and Shelah S.. Martin's maximum, saturated ideals, and non-regular ultrafilters. Part I. Annals of mathematics, ser. 2 vol. 127 (1988), pp. 1–47, and vol. 129 (1989), p. 651. [REVIEW]Boban Veličković - 1992 - Journal of Symbolic Logic 57 (3):1131-1132.
SB Cooper, TA Slaman, and SS Wainer, eds. Computability, Enumerability, Unsolvability: Directions in Recursion Theory.R. Downey - 1997 - Journal of Logic Language and Information 6:107-109.
J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur, A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauquois, J. H. Wegstein, A. van Wijngaarden, and M. Woodger. Revised report on the algorithmic language ALGOL 60. Numerische Mathematik, vol. 4 , pp. 420–453; also ibid., vol. 6 , pp. 1–17; and The computer journal, vol. 5 no. 4 , pp. 349–367. [REVIEW]Karel Čulík - 1972 - Journal of Symbolic Logic 37 (3):623-624.
J. A. Makowsky, Saharon Shelah, and Jonathan Stavi. ⊿-logics and generalized quantifiers. Annals of mathematical logic, vol. 10 , pp. 155–192. [REVIEW]Jouko Väänänen - 1985 - Journal of Symbolic Logic 50 (1):241-242.
Martin’s Maximum and definability in H.Paul B. Larson - 2008 - Annals of Pure and Applied Logic 156 (1):110-122.
J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, an. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
H. Rogers, jr.W. Sieg & J. Byrnes - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 140--35.
Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Mathematical Logic Quarterly 38 (1):189-195.

Analytics

Added to PP
2014-01-27

Downloads
12 (#1,114,703)

6 months
2 (#1,259,626)

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