Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,476,577 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
(opens in a new tab)
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.
2018
2018
Inference Situations, Counter-Model Constructions and A Computer Implementation of A Logic Composed of Intersecting Adjectives and the Quantifier “More’’
Selçuk Topal
,
Yasin Akünsoy
2018
Corpus ID: 55541403
In this paper, we study the logic of language of $ L(More,IA) $. The logic contains the quantifier called ‘’ more ‘’ which makes…
Expand
2008
2008
ay 2 00 7 Relatively recursively enumerable reals
Bernard A. Anderson
2008
Corpus ID: 17242767
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
2002
2002
Decision Problems in the Lattice of P01 Classes
L. Lawton
2002
Corpus ID: 125316884