Index sets in the arithmetical Hierarchy

Annals of Pure and Applied Logic 37 (2):101-110 (1988)
  Copy   BIBTEX

Abstract

We prove the following results: every recursively enumerable set approximated by finite sets of some set M of recursively enumerable sets with index set in π 2 is an element of M , provided that the finite sets in M are canonically enumerable. If both the finite sets in M and in M̄ are canonically enumerable, then the index set of M is in σ 2 ∩ π 2 if and only if M consists exactly of the sets approximated by finite sets of M and the complement M̄ consists exactly of the sets approximated by finite sets of M̄ . Under the same condition M or M̄ has a non-empty subset with recursively enumerable index set, if the index set of M is in σ 2 ∩ π 2 . If the finite sets in M are canonically enumerable, then the following three statements are equivalent: the index set of M is in σ 2 \ π 2 , the index set of M is σ 2 -complete, the index set of M is in σ 2 and some sequence of finite sets in M approximate a set in M̄ . Finally, for every n ⩾ 2, an index set in σ n \ π n is presented which is not σ n -complete

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

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

Exact equiconsistency results for Δ 3 1 -sets of reals.Haim Judah - 1992 - Archive for Mathematical Logic 32 (2):101-112.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.
Structural properties and Σ20 enumeration degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285-292.

Analytics

Added to PP
2014-01-16

Downloads
28 (#138,667)

6 months
13 (#1,035,185)

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

Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Mathematical Logic Quarterly 20 (13‐18):239-254.
Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):239-254.
Review: Manuel Blum, On the Size of Machines. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (1):199-200.

Add more references