Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees

DOI10.1090/S0002-9947-01-02821-5zbMath0978.03033MaRDI QIDQ2750927

Eberhard Herrmann, Peter A. Cholak, Richard J. Coles, Rodney G. Downey

Publication date: 21 October 2001

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

invarianceautomorphismsthin class

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items

Degrees containing members of thin Π10 classes are dense and co-dense, COMPUTABLY COMPACT METRIC SPACES, TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES, Effectively closed sets and enumerations, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Decidability of the AE-theory of the lattice of \({\Pi}_1^0\) classes, The upward closure of a perfect thin class, Immunity for Closed Sets, Comparing the Medvedev and Turing degrees of Π⁰₁ classes, Small \(\Pi^{0}_{1}\) classes, 2003-04 Winter Meeting of the Association for Symbolic Logic, On the degree spectrum of a $\Pi ^0_1$ class, Almost complemented \(\Pi^{0}_{1}\) classes, Mass Problems and Randomness, Invariance in ℰ* and ℰ_{Π}, Mass problems associated with effectively closed sets, Degree invariance in the Π₁⁰classes, Calibrating Randomness, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees, Integer valued betting strategies and Turing degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of substructure lattices in recursive algebra
• Maximal theories
• Countable thin \(\Pi^0_1\) classes
• A maximal set which is not complete
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Post's program and incomplete recursively enumerable sets.
• Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Axiomatizable theories with few axiomatizable extensions
• Hierarchies of Boolean algebras
• ∏ 0 1 Classes and Degrees of Theories
• Note on arithmetic models for consistent formulae of the predicate calculus
• Recursively enumerable sets of positive integers and their decision problems