Countable thin \(\Pi^0_1\) classes
type: Item
instance of: scholarly article
title: Countable thin \(\Pi^0_1\) classes
zbMATH Open document ID: 0909.03039
DOI: 10.1016/0168-0072(93)90001-T
author: Douglas Cenzer
author: Carl G. jun. Jockusch
author: Richard A. Shore
author: Rodney G. Downey
published in: Annals of Pure and Applied Logic
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 165823
zbMATH Keywords: lattice of recursively enumerable sets
zbMATH Keywords: paths in a recursive infinite tree
zbMATH Keywords: Cantor-Bendixson rank
zbMATH Keywords: maximal sets
zbMATH Keywords: undecidability degree
zbMATH Keywords: propositional theories
zbMATH Keywords: recursive Boolean algebras
MaRDI profile type: Publication
cites work: Members of countable \(\Pi ^ 0_ 1\) classes
cites work: Polynomial-time versus recursive models
cites work: Recursively presented games and strategies
cites work: On the ranked points of a Π10 set
cites work: On Recursive Trees with a Unique Infinite Branch
cites work: Retraceable Sets
cites work: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
cites work: Maximal theories
cites work: On \(\Pi{}^ 0_ 1\) classes and their ranked points
cites work: Q3197814
cites work: Hierarchies of Boolean algebras
cites work: Countable algebra and set existence axioms
cites work: Some properties of the constructivization of Boolean algebras
cites work: Semirecursive Sets and Positive Reducibility
cites work: Relationships Between Reducibilities
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: Q5541832
cites work: On the Lattice of Recursively Enumerable Sets
cites work: Initial segments of the degrees of unsolvability
cites work: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability
cites work: The Degrees of Hyperimmune Sets
cites work: Axiomatizable theories with few axiomatizable extensions
cites work: Effective content of field theory
cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
cites work: Recursively enumerable Boolean algebras
cites work: Q5573961
cites work: Effective aspects of profinite groups
cites work: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
cites work: Q4040892
cites work: Recursively Enumerable Sets and Retracing Functions
description: scientific article; zbMATH DE number 165823