Computing distributed knowledge as the greatest lower bound of knowledge

DOI10.1007/978-3-030-88701-8_25MaRDI QIDQ2695370zbMATH OpenOpenAlexFDO

Authors Carlos Pinzón, Santiago Quintero, Sergio Ramírez, Frank D. Valencia

Publication date 30 March 2023

Full work available at URL https://arxiv.org/abs/2210.08128

zbMATH Keywords

lattice algorithmsdistributive knowledgejoin-endomorphims

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• A completeness theorem in modal logic
• Agreeing to disagree
• Agreeing to disagree: the non-probabilistic case
• An improved equivalence algorithm
• Boolean Algebras with Operators
• Boolean Algebras with Operators. Part I
• Bounded distributive lattice expansions
• Bounded lattice expansions
• Canonical extensions and relational completeness of some substructural logics
• Counting and Computing Join-Endomorphisms in Lattices
• Generating all finite modular lattices of a given size
• Handbook of Spatial Logics
• Knowledge and common knowledge in a distributed environment
• On closed elements in closure algebras
• On the Lattice of All Join-Endomorphisms of a Lattice
• On the canonicity of Sahlqvist identities
• Proof Theory for Distributed Knowledge
• Resolving distributed knowledge
• S5 knowledge without partitions
• Tree structure for distributive lattices and its applications
• Varieties of complex algebras

Cited in

(1)

• Distributed knowability and Fitch's paradox

This page was built for publication: Computing distributed knowledge as the greatest lower bound of knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695370)