Computing distributed knowledge as the greatest lower bound of knowledge
From MaRDI portal
Publication:2695370
DOI10.1007/978-3-030-88701-8_25OpenAlexW3207486432MaRDI QIDQ2695370FDOQ2695370
Santiago Quintero, Sergio Ramírez, Frank D. Valencia, Carlos Pinzón
Publication date: 30 March 2023
Full work available at URL: https://arxiv.org/abs/2210.08128
Cites Work
- A completeness theorem in modal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- Agreeing to disagree
- Varieties of complex algebras
- On closed elements in closure algebras
- Title not available (Why is that?)
- Bounded distributive lattice expansions
- Canonical extensions and relational completeness of some substructural logics
- Bounded lattice expansions
- Handbook of Spatial Logics
- Knowledge and common knowledge in a distributed environment
- Tree structure for distributive lattices and its applications
- On the canonicity of Sahlqvist identities
- Proof Theory for Distributed Knowledge
- Agreeing to disagree: the non-probabilistic case
- On the Lattice of All Join-Endomorphisms of a Lattice
- An improved equivalence algorithm
- Generating all finite modular lattices of a given size
- S5 knowledge without partitions
- Resolving distributed knowledge
- Counting and Computing Join-Endomorphisms in Lattices
Cited In (1)
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)
