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

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

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

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

zbMATH Keywords

lattice theoryequivalence relationssubrecursive sets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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)