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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
  • Rebecca Weber
  • The Journal of Symbolic Logic
  • 2011
  • Corpus ID: 20836763
Abstract Let denote the collection of all Π10 classes, ordered by inclusion. A collection of Turing degrees in is called… Expand
2010
2010
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor… Expand
Review
2010
Review
2010
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
2008
2008
  • 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… Expand
2007
2007
  • 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… Expand
2007
2007
For a pseudojump operator VXand a$\Pi^0_1$ class P, we consider properties of the set{VX: XeP}. We show that there always exists… Expand
2006
2006
  • 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… Expand
2006
2006
We explore an analogue of major subset for 1 classes, which leads to the definition and characterization of almost complemented 1… Expand
2004
2004
Abstract.Let w and M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π10 subsets of 2ω, under… Expand