Regular enumerations

DOI10.2178/JSL/1190150287zbMath1053.03024OpenAlexW4242147210MaRDI QIDQ4451721

V. Baleva, Ivan N. Soskov

Publication date: 1 March 2004

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1190150287

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Enumeration Reducibility and Computable Structure Theory ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Generalizations of enumeration reducibility using recursive infinitary propositional sentences
• A jump inversion theorem for the enumeration jump
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• 1-genericity in the enumeration degrees
• Maximal Arithmetical Reducibilities
• Arithmetical Reducibilities I

This page was built for publication: Regular enumerations