Effectively closed sets and enumerations

DOI10.1007/s00153-008-0065-7zbMath1140.03026OpenAlexW2021466741MaRDI QIDQ926187

Douglas Cenzer, Paul Brodhead

Publication date: 26 May 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0065-7

zbMATH Keywords

numberingscomputable permutationcomputable treeseffectively closed set

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, Turing degrees of multidimensional SFTs, Computable elements and functions in effectively enumerable topological spaces, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, A Friedberg enumeration of equivalence structures, Uniquely universal sets, Computable symbolic dynamics, Effectively closed sets and enumerations, Continuity of capping in \(\mathcal C_{\text{bT}}\), Effective Symbolic Dynamics, Numberings and Randomness, Effectively closed subgroups of the infinite symmetric group, Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively closed sets and enumerations
• Maximal theories
• Countable thin \(\Pi^0_1\) classes
• Index sets for \(\Pi^0_1\) classes
• Effectively closed sets and graphs of computable real functions.
• Small \(\Pi^{0}_{1}\) classes
• Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• Enumeration of Recursive Sets
• Mass Problems and Randomness
• Hyperarithmetical Index Sets in Recursion Theory
• Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes
• Recursively enumerable classes and their application to recursive sequences of formal theories
• ∏ 0 1 Classes and Degrees of Theories