Subrecursive equivalence relations and (non-)closure under lattice operations
From MaRDI portal
Publication:2117798
DOI10.1007/978-3-030-80049-9_34OpenAlexW3187073320MaRDI QIDQ2117798FDOQ2117798
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of equivalence relations
- The intensional content of Rice's theorem
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Computably enumerable equivalence relations
- Some undecidability results for lattices in recursion theory
- Indexings of subrecursive classes
- Reducibilities among equivalence relations induced by recursively enumerable structures
- The Lattice of Lambda Theories
- Chains, antichains, and complements in infinite partition lattices
- Minimum-complexity pairing functions
- THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- A Survey on Universal Computably Enumerable Equivalence Relations
- Joins and meets in the structure of ceers
- More intensional versions of Rice's theorem
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
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)
