Topological framework for finite injury

Mathematical Logic Quarterly 38 (1):189-195 (1992)
  Copy   BIBTEX

Abstract

We formulate an abstract version of the finite injury method in the form of the Baire category theorem. The theorem has the following corollaries: The Friedberg-Muchnik pair of recursively enumerable degrees, the Sacks splitting theorem, the existence of a minimal degree below 0′ and the Shoenfield jump theorem

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380114

Other Versions

reprint Kontostathis, Kyriakos (1992) "Topological framework for finite injury". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38(1):189-195

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

Notes on Sacks’ Splitting Theorem.Klaus Ambos-Spies, Rod G. Downey, Martin Monath & N. G. Keng Meng - 2024 - Journal of Symbolic Logic 89 (4):1768-1797.
Jump Theorems for REA Operators.Alistair H. Lachlan & Xiaoding Yi - 1993 - Mathematical Logic Quarterly 39 (1):1-6.
On the role of the baire category theorem and dependent choice in the foundations of logic.Robert Goldblatt - 1985 - Journal of Symbolic Logic 50 (2):412-422.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
On the Uniform Computational Content of the Baire Category Theorem.Vasco Brattka, Matthew Hendtlass & Alexander P. Kreuzer - 2018 - Notre Dame Journal of Formal Logic 59 (4):605-636.
An analogue of the Baire category theorem.Philipp Hieronymi - 2013 - Journal of Symbolic Logic 78 (1):207-213.
§ 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]David P. Miller - 1981 - In Manuel Lerman, James Henry Schmerl & Robert Irving Soare (eds.), Logic year 1979-80, the University of Connecticut, USA. New York: Springer Verlag. pp. 859--230.
The Sacks density theorem and Σ2-bounding.Marcia Groszek, Michael Mytilinaios & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.

Analytics

Added to PP
2013-12-01

Downloads
15 (#1,229,188)

6 months
5 (#1,035,390)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A general framework for priority arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.
The combinatorics of the splitting theorem.Kyriakos Kontostathis - 1997 - Journal of Symbolic Logic 62 (1):197-224.

Add more citations

References found in this work

Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.

Add more references