Logics for Contact and Measure
Abstract
We enrich contact algebras with a new binary relation that compares the size of regions, and provide axiom systems for various logics of contact and measure. Our contribution is three-fold: (1) we characterize the relations on a Boolean algebra that derive from a measure, thereby improving an old result of Kraft, Pratt and Seidenberg; (2) for all n≥1, we axiomatize the logic of regular closed sets of R^n with null boundary; (3) considering a broad class of equational theories that contains all logics of contact, we prove that they all have unary or finitary unification, and that unification and admissibility are decidable.
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|