Mass problems and hyperarithmeticity

Journal of Mathematical Logic 7 (2):125-143 (2007)
  Copy   BIBTEX

Abstract

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if for all Y ∈ Q there exists X ∈ P such that X is Turing reducible to Y. A weak degree is an equivalence class of mass problems under mutual weak reducibility. Let [Formula: see text] be the lattice of weak degrees of mass problems associated with nonempty [Formula: see text] subsets of the Cantor space. The lattice [Formula: see text] has been studied in previous publications. The purpose of this paper is to show that [Formula: see text] partakes of hyperarithmeticity. We exhibit a family of specific, natural degrees in [Formula: see text] which are indexed by the ordinal numbers less than [Formula: see text] and which correspond to the hyperarithmetical hierarchy. Namely, for each [Formula: see text], let hα be the weak degree of 0, the αth Turing jump of 0. If p is the weak degree of any mass problem P, let p* be the weak degree of the mass problem P* = {Y | ∃X ⊆ BLR )} where BLR is the set of functions which are boundedly limit recursive in X. Let 1 be the top degree in [Formula: see text]. We prove that all of the weak degrees [Formula: see text], [Formula: see text], are distinct and belong to [Formula: see text]. In addition, we prove that certain index sets associated with [Formula: see text] are [Formula: see text] complete.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Ethical problems of mass murder coverage in the mass media.Clayton E. Cramer - 1994 - Journal of Mass Media Ethics 9 (1):26 – 42.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.
The Metaphysics of Mass Expressions.Mark Steen - 2012 - Stanford Encyclopedia of Philosophy.
Intrinsic and extrinsic properties.Ross Cameron - 2009 - In Robin Le Poidevin, Simons Peter, McGonigal Andrew & Ross P. Cameron (eds.), The Routledge Companion to Metaphysics. New York: Routledge.
The mereological constancy of masses.Charlie Tanksley - 2010 - Philosophical Quarterly 60 (239):343-354.
Mass torts and moral principles.Alan Strudler - 1992 - Law and Philosophy 11 (4):297 - 330.
A Philosophy of Mass Art.Noël Carroll - 1997 - Clarendon Press.

Analytics

Added to PP
2010-08-30

Downloads
53 (#288,387)

6 months
8 (#292,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.
Randomness and lowness notions via open covers.Laurent Bienvenu & Joseph S. Miller - 2012 - Annals of Pure and Applied Logic 163 (5):506-518.
Tracing and domination in the Turing degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.
Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.

View all 14 citations / Add more citations

References found in this work

Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Almost everywhere domination and superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.
Density of the Medvedev lattice of Π0 1 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.

View all 15 references / Add more references