Semi-metrics, closure spaces and digital topology
Selected papers of the workshop on Topology and completion in semantics
Modal logics for local and global similarity relations
Fundamenta Informaticae
A note on proximity spaces and connection based mereology
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Computing Transivity Tables: A Challenge For Automated Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A representation theorem for Boolean contact algebras
Theoretical Computer Science
The lattice of contact relations on a Boolean algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Nature-inspired framework for measuring visual image resemblance: A near rough set approach
Theoretical Computer Science
Development of Near Sets Within the Framework of Axiomatic Fuzzy Sets
Fundamenta Informaticae
Extension properties of boolean contact algebras
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Hi-index | 0.00 |
We introduce Boolean proximity algebras as a generalization of Efremovi驴 proximities which are suitable in reasoning about discrete regions. Following Stone's representation theorem for Boolean algebras, it is shown that each such algebra is isomorphic to a substructure of a complete and atomic Boolean proximity algebra.