Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Π01 class

Known as: Pi01 class 
In computability theory, a Π01 class is a subset of 2ω of a certain form. These classes are of interest as a technical tool within recursion theory… Expand
Wikipedia

Related topics

Related topics

6 relations
Arithmetical hierarchyEffective descriptive set theoryFirst-order logicLow basis theorem
Expand

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Degree invariance in the Π01 classes
Let denote the collection of all Π 1 0 classes, ordered by inclusion. A collection of Turing degrees in is called invariant over… Expand
Is this relevant?
Review
2010
Review
2010
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination
We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been… Expand
Is this relevant?
2010
2010
Computability of Countable Subshifts
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor… Expand
Is this relevant?
2008
2008
ay 2 00 7 Relatively recursively enumerable reals
We say that a real X is relatively r.e. if there exists a real Y such that X is r.e. (Y ) and X 6≤T Y . We say X is relatively… Expand
Is this relevant?
2007
2007
Non-branching degrees in the Medvedev lattice of Π01 classes
A method of forming a circuitry testing substrate for testing circuitry of another substrate which has a plurality of exposed… Expand
Is this relevant?
2007
2007
Π1 CLASSES WITH COMPLEX ELEMENTS
An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable… Expand
Is this relevant?
2006
2006
Almost complemented Π01 classes
We explore an analogue of major subset for Π01 classes, which leads to the definition and characterization of almost complemented… Expand
Is this relevant?
2006
2006
Mathematical Logic
We explore an analogue of major subset for 1 classes, which leads to the definition and characterization of almost complemented 1… Expand
Is this relevant?
2004
2004
Embeddings into the Medvedev and Muchnik lattices of Π01 classes
Abstract.Let w and M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π10 subsets of 2ω, under… Expand
Is this relevant?
2002
2002
Decision Problems in the Lattice of P01 Classes
 
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE