Immunity and Hyperimmunity for Sets of Minimal Indices

Notre Dame Journal of Formal Logic 49 (2):107-125 (2008)
  Copy   BIBTEX

Abstract

We extend Meyer's 1972 investigation of sets of minimal indices. Blum showed that minimal index sets are immune, and we show that they are also immune against high levels of the arithmetic hierarchy. We give optimal immunity results for sets of minimal indices with respect to the arithmetic hierarchy, and we illustrate with an intuitive example that immunity is not simply a refinement of arithmetic complexity. Of particular note here are the fact that there are three minimal index sets located in Π3 − Σ3 with distinct levels of immunity and that certain immunity properties depend on the choice of underlying acceptable numbering. We show that minimal index sets are never hyperimmune; however, they can be immune against the arithmetic sets. Lastly, we investigate Turing degrees for sets of random strings defined with respect to Bagchi's size-function s

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 86,273

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

Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
On the weak Kleene scheme in Kripke's theory of truth.James Cain & Zlatan Damnjanovic - 1991 - Journal of Symbolic Logic 56 (4):1452-1468.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
On the immunity principle: a view from a robot.Jonathan Cole & Oliver Sacks - 2000 - Trends in Cognitive Sciences 4 (5):167.
Hyperimmunity in 2\sp ℕ.Stephen Binns - 2007 - Notre Dame Journal of Formal Logic 48 (2):293-316.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.

Analytics

Added to PP
2010-08-24

Downloads
34 (#388,117)

6 months
1 (#864,772)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An incomplete set of shortest descriptions.Frank Stephan & Jason Teutsch - 2012 - Journal of Symbolic Logic 77 (1):291-307.

Add more citations

References found in this work

A guided tour of minimal indices and shortest descriptions.Marcus Schaefer - 1998 - Archive for Mathematical Logic 37 (8):521-548.
Review: Manuel Blum, On the Size of Machines. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (1):199-200.
1-reducibility inside an m-degree with maximal set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
Recursive Enumerability and the Jump Operator.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):204-204.

Add more references