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

invariance; automorphisms; thin class

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

03D45: Theory of numerations, effectively presented structures

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item