Subrecursive equivalence relations and (non-)closure under lattice operations

DOI10.1007/978-3-030-80049-9_34OpenAlexW3187073320MaRDI QIDQ2117798

Jakob Grue Simonsen, Jean-Yves Moyen

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_34

zbMATH Keywords

equivalence relationslattice theorysubrecursive sets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some undecidability results for lattices in recursion theory
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Indexings of subrecursive classes
• Minimum-complexity pairing functions
• Chains, antichains, and complements in infinite partition lattices
• More intensional versions of Rice's theorem
• Theory of equivalence relations
• COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
• A Survey on Universal Computably Enumerable Equivalence Relations
• THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• The intensional content of Rice's theorem
• The Lattice of Lambda Theories
• Joins and meets in the structure of ceers
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Computably enumerable equivalence relations

This page was built for publication: Subrecursive equivalence relations and (non-)closure under lattice operations