Isolated sublattices and their application to counting closure operators

DOI10.1007/978-3-030-88701-8_12OpenAlexW3211200117MaRDI QIDQ2695353

Roland Glück

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_12

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inference engine based on closure and join operators over truth table binary relations
• Varieties of lattices
• Counting finite linearly ordered involutive bisemilattices
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
• Model Refinement Using Bisimulation Quotients
• Lattice Theory: Foundation
• Counting of Moore Families for n=7
• Generation of Union Closed Sets and Moore families
• Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests
• Counting and Computing Join-Endomorphisms in Lattices
• Algebraic Investigation of Connected Components

This page was built for publication: Isolated sublattices and their application to counting closure operators