Small Π01 Classes

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

Abstract

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

Other Versions

original Binns, Stephen (2005) "Small Π0 1 Classes". Archive for Mathematical Logic 45(4):393-410

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,319

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

Small Π0 1 Classes.Stephen Binns - 2005 - Archive for Mathematical Logic 45 (4):393-410.
Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.
Minimal extensions of Π01 classes.Douglas Cenzer & Farzan Riazati - 2005 - Mathematical Logic Quarterly 51 (2):206-216.
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
Computable symbolic dynamics.Douglas Cenzer, S. Ali Dashti & Jonathan L. F. King - 2008 - Mathematical Logic Quarterly 54 (5):460-469.
Computable symbolic dynamics.Douglas Cenzer, S. Dashti & Jonathan F. King - 2008 - Mathematical Logic Quarterly 54 (5):460-469.
Degree invariance in the Π10classes.Rebecca Weber - 2011 - Journal of Symbolic Logic 76 (4):1184-1210.
Π01-classes and Rado's selection principle.C. G. Jockusch, A. Lewis & J. B. Remmel - 1991 - Journal of Symbolic Logic 56 (2):684 - 693.
A Rank One Cohesive Set. Downey & Yang Yue - 1994 - Annals of Pure and Applied Logic 68 (2):161-171.

Analytics

Added to PP
2017-02-22

Downloads
20 (#1,128,084)

6 months
8 (#508,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
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.

View all 6 citations / Add more citations

References found in this work

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.
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.

View all 7 references / Add more references