Counting and Computing Join-Endomorphisms in Lattices
From MaRDI portal
Publication:5098726
DOI10.1007/978-3-030-43520-2_16OpenAlexW2995858560MaRDI QIDQ5098726
Frank D. Valencia, Sergio Ramírez, Camilo Rueda, Santiago Quintero
Publication date: 30 August 2022
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43520-2_16
Related Items (4)
Unitless Frobenius quantales ⋮ Isolated sublattices and their application to counting closure operators ⋮ Computing distributed knowledge as the greatest lower bound of knowledge ⋮ Reasoning about distributed information with infinitely many agents
Cites Work
- Unnamed Item
- Unnamed Item
- Belief, knowledge, lies and other utterances in an algebra for space and extrusion
- Generating all finite modular lattices of a given size
- Why mathematical morphology needs complete lattices
- Enumeration of order preserving maps
- Tree structure for distributive lattices and its applications
- On validity in modelization of musical problems by CCP
- Reasoning about distributed information with infinitely many agents
- On discrete idempotent paths
- Spatial and Epistemic Modalities in Constraint-Based Process Calculi
- On the Lattice of All Join-Endomorphisms of a Lattice
- Handbook of Spatial Logics
- Continuous Lattices and Domains
- Relation Algebras, Idempotent Semirings and Generalized Bunched Implication Algebras
This page was built for publication: Counting and Computing Join-Endomorphisms in Lattices
