Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,180,790 papers from all fields of science
Search
Sign In
Create Free Account
Π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
Create Alert
Alert
Related topics
Related topics
6 relations
Arithmetical hierarchy
Effective descriptive set theory
First-order logic
Low basis theorem
Expand
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
David Diamondstone
,
D. Dzhafarov
,
R. Soare
Notre Dame J. Formal Log.
2010
Corpus ID: 7317516
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
2010
2010
Computability of Countable Subshifts
D. Cenzer
,
S. Dashti
,
Ferit Toska
,
S. Wyman
CiE
2010
Corpus ID: 6015505
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor…
Expand
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…
Expand
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…
Expand
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…
Expand
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…
Expand
2006
2006
Mathematical Logic
L. Lawton
,
L. Lawton
2006
Corpus ID: 207765976
We explore an analogue of major subset for 1 classes, which leads to the definition and characterization of almost complemented 1…
Expand
2004
2004
Embeddings into the Medvedev and Muchnik lattices of Π01 classes
S. Binns
,
S. G. Simpson
Arch. Math. Log.
2004
Corpus ID: 16668999
Abstract.Let w and M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π10 subsets of 2ω, under…
Expand
2002
2002
Decision Problems in the Lattice of P01 Classes
L. Lawton
2002
Corpus ID: 125316884
1994
1994
A Rank one Cohesive Set
R. Downey
,
Yang Yue
Ann. Pure Appl. Log.
1994
Corpus ID: 39819104
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