Small Π0 1 Classes

Archive for Mathematical Logic 45 (4):393-410 (2005)
  Copy   BIBTEX

Abstract

The property of smallness for Π0 1 classes is introduced and is investigated with respect to Medvedev and Muchnik degree. It is shown that the property of containing a small Π0 1 class depends only on the Muchnik degree of a Π0 1 class. A comparison is made with the idea of thinness for Π0 1 classesmsthm

Categories

Keywords

Reprint years

2006

DOI

10.1007/s00153-005-0319-6

Links

PhilArchive



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

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

Small Π01 Classes.Stephen Binns - 2006 - Archive for Mathematical Logic 45 (4):393-410.
Density of the Medvedev lattice of Π0 1 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.
Almost complemented Π0 1 classes.Linda Lawton - 2006 - Archive for Mathematical Logic 45 (5):555-568.
The Medvedev lattice of computably closed sets.Sebastiaan A. Terwijn - 2006 - Archive for Mathematical Logic 45 (2):179-190.
Embeddings into the Medvedev and Muchnik lattices of Π0 1 classes.Stephen Binns & Stephen G. Simpson - 2004 - Archive for Mathematical Logic 43 (3):399-414.
Epsilon substitution method for [Π0 1, Π0 1]-FIX.T. Arai - 2005 - Archive for Mathematical Logic 44 (8):1009-1043.
A Minimal Pair of Π0 1 Classes.Carl G. Jockusch Jr & Robert I. Soare - 1971 - Journal of Symbolic Logic 36 (1):66 - 78.
On one-sided versus two-sided classification.Stephan Frank - 2001 - Archive for Mathematical Logic 40 (7):489-513.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.

Analytics

Added to PP
2013-12-01

Downloads
32 (#486,594)

6 months
5 (#836,975)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.
Hyperimmunity in 2.Stephen Binns - 2007 - Notre Dame Journal of Formal Logic 48 (2).
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.
On effectively closed sets of effective strong measure zero.Kojiro Higuchi & Takayuki Kihara - 2014 - Annals of Pure and Applied Logic 165 (9):1445-1469.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.

View all 10 references / Add more references