Index sets for \(\Pi^0_1\) classes
type: Item
instance of: scholarly article
title: Index sets for \(\Pi^0_1\) classes
zbMATH Open document ID: 0926.03042
DOI: 10.1016/S0168-0072(97)00052-3
author: Douglas Cenzer
author: Jeffrey Remmel
published in: Annals of Pure and Applied Logic
publication date: 1999-11-23T00:00:00Z
review text: The authors present an effective enumeration of the \(\Pi_1^0\) classes and then investigate the index sets corresponding to various properties of \(\Pi_1^0\) classes. The paper deals with index sets arising in a wide range of contexts, from measure and category to logical theories to combinatorial questions. Particular attention is paid to boundedness of trees, with a couple of new versions of boundedness being introduced.
reviewed by: Leon Harkleroad
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D55
Mathematics Subject Classification ID: 03D80
zbMATH DE Number: 1308072
zbMATH Keywords: index set
zbMATH Keywords: \(\Pi_1^0\) class
zbMATH Keywords: effective enumeration
zbMATH Keywords: measure and category
zbMATH Keywords: logical theories
zbMATH Keywords: combinatorial questions
zbMATH Keywords: boundedness of trees
MaRDI profile type: Publication
cites work: Effective coloration
cites work: On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
cites work: On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
cites work: Members of countable \(\Pi ^ 0_ 1\) classes
cites work: Countable thin \(\Pi^0_1\) classes
cites work: On the Borel class of the derived set operator. II
cites work: Q5551157
cites work: Hierarchies of Boolean algebras
cites work: Q4249726
cites work: Q4764107
cites work: Index sets of finite classes of recursively enumerable sets
cites work: A topological analog to the Rice-Shapiro index theorem
cites work: The index set {e: We ≡1X}.
cites work: Q4146722
cites work: Π01-classes and Rado's selection principle
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: Hierarchies of number-theoretic predicates
cites work: Q3269140
cites work: Q5605137
cites work: Hyperarithmetical Index Sets in Recursion Theory
cites work: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
cites work: Axiomatizable theories with few axiomatizable extensions
cites work: Classical recursion theory. Vol. II
cites work: On the Effectiveness of the Schroder-Bernstein Theorem
cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
cites work: Index sets in the hyperarithmetical hierarchy
cites work: Index sets of classes of hyper-hypersimple sets
cites work: Fine hierarchy and definable index sets
cites work: Degrees of formal systems
cites work: Q4040892
cites work: Recursive and r.e. quotient Boolean algebras
Recommended article: On realization of index sets in \(\Pi_1^0\)-classes
Recommended article: Index sets of classes of hyper-hypersimple sets
Recommended article: Classification of the index sets of low \([n]^ p\) and high \([n]^ p\)
Recommended article: Q3741620
Recommended article: Q4513963
Recommended article: Q4316688
Recommended article: Index sets of quotient objects of the Post numeration
Recommended article: A class of $I_0$-sets
Recommended article: Almost complemented \(\Pi^{0}_{1}\) classes
Recommended article: On \(\Pi{}^ 0_ 1\) classes and their ranked points
description: scientific article; zbMATH DE number 1308072