Isolated suborders and their application to counting closure operators
From MaRDI portal
Publication:6597961
DOI10.46298/lmcs-20(3:11)2024MaRDI QIDQ6597961
Publication date: 4 September 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inference engine based on closure and join operators over truth table binary relations
- Reducible classes of finite 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
- Isolated sublattices and their application to counting closure operators
- Model Refinement Using Bisimulation Quotients
- Counting of Moore Families for n=7
- Generation of Union Closed Sets and Moore families
- Generating Posets Beyond N
- Algebraic Investigation of Connected Components
- Isolated suborders and their application to counting closure operators
Related Items (1)
This page was built for publication: Isolated suborders and their application to counting closure operators
