Skip to search formSkip to main contentSkip to account menu

Π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… 
Wikipedia

Related topics

Related topics

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

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… 
2010
2010
Computability of Countable Subshifts
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor… 
2008
2008
Π10 classes with complex elements
  • S. Binns
  • Journal of Symbolic Logic
  • 2008
  • Corpus ID: 1149675
Abstract An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a… 
2008
2008
Classifying the Branching Degrees in the Medvedev Lattice of Π01 Classes
  • C. Alfeld
  • Notre Dame J. Formal Log.
  • 2008
  • Corpus ID: 41637643
A Π 1 0 class can be defined as the set of infinite paths through a computable tree. For classes P and Q , say that P is Medvedev… 
2007
2007
Non-branching degrees in the Medvedev lattice of Π10 classes
  • C. Alfeld
  • Journal of Symbolic Logic
  • 2007
  • Corpus ID: 11171790
Abstract A class is the set of paths through a computable tree. Given classes P and Q, P is Medvedev reducible to Q, P ≤MQ, if… 
2006
2006
Almost complemented Π01 classes
  • L. Lawton
  • Arch. Math. Log.
  • 2006
  • Corpus ID: 206886745
We explore an analogue of major subset for Π01 classes, which leads to the definition and characterization of almost complemented… 
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… 
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… 
2002
2002
Decision Problems in the Lattice of P01 Classes
1994
1994
A Rank one Cohesive Set
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