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

DOI10.1007/978-3-030-80049-9_34MaRDI QIDQ2117798zbMATH OpenOpenAlexFDO

Authors Jean-Yves Moyen, Jakob Grue Simonsen

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)

Recommendations

• Lattices of equivalence relations closed under the operations of relation algebras
• Equational closure operator and forbidden semidistributive lattices
• The lattice of recursively enumerable substructures of an effective closure system
• The lattice of closure operators on a subgroup lattice
• Congruence relations on lattices of recursively enumerable sets
• scientific article; zbMATH DE number 4035813
• Lattice of recursively enumerable subalgebras of a recursive Boolean algebra
• Lattices of algebraic subsets and implicational classes
• Relational Methods in Computer Science
• Closure operators in almost distributive lattices

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• A survey on universal computably enumerable equivalence relations
• Chains, antichains, and complements in infinite partition lattices
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Complexity of equivalence relations and preorders from computability theory
• Computably enumerable equivalence relations
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 1313604 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Indexings of subrecursive classes
• Joins and meets in the structure of ceers
• Minimum-complexity pairing functions
• More intensional versions of Rice's theorem
• Reducibilities among equivalence relations induced by recursively enumerable structures
• Some undecidability results for lattices in recursion theory
• The complexity of index sets of classes of computably enumerable equivalence relations
• The intensional content of Rice's theorem
• The Lattice of Lambda Theories
• Theory of equivalence relations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117798)