Relational Methods in Computer Science
From MaRDI portal
(Redirected from Publication:5899303)
Relational Methods in Computer Science (scientific article; zbMATH DE number 5148662)
Relational Methods in Computer Science (scientific article; zbMATH DE number 5148662)
Recommendations
- Topological representation of precontact algebras and a connected version of the Stone duality theorem. I.
- Dynamic contact algebras with a predicate of actual existence: snapshot representation and topological duality
- A representation theorem for Boolean contact algebras
- Topological Representation of Contact Lattices
- Distributive contact lattices: topological representations
Cited in
(16)- On dimension andweight of a local contact algebra
- Irreducible equivalence relations, Gleason spaces, and de Vries duality
- Extensions of dualities and a new approach to the Fedorchuk duality
- Subordination algebras as semantic environment of input/output logic
- Bounded distributive lattices with two subordinations
- Topological representation of precontact algebras and a connected version of the Stone duality theorem. I.
- A variety of algebras closely related to subordination algebras
- A representation theorem for Boolean contact algebras
- A calculus of regions respecting both measure and topology
- Logics for contact and measure
- Logics for contact and measure
- A generalization of the Stone duality theorem
- The Lattice of Contact Relations on a Boolean Algebra
- Subordinations on bounded distributive lattices
- Distributive contact lattices: topological representations
- Dynamic mereotopology. III: Whiteheadean type of integrated point-free theories of space and time. I
This page was built for publication: Relational Methods in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899303)