How to Augment a Formal System with a Boolean Algebra Component
- 164 Downloads
Reasoning with Boolean Algebras is just propositional reasoning. This is well investigated and a lot of good algorithms have been developed. Other formal systems, for example mathematical programming for reasoning about arithmetical equation systems, are equally well developed. Combining such a system with a Boolean component where the Boolean expressions are interpreted as sets, would allow one to use arithmetical algorithms to reason about numerical features of sets.
KeywordsBoolean Algebra Formal System Boolean Variable Atomic Decomposition Additivity Axiom
Unable to display preview. Download preview PDF.
- Gabbay, D. M.: 1996, `An Overview of Fibred Semantics and The Combination of Logics’. In: F. B. K. Schulz (ed.): Proceedings of FroCoS’96, Frontiers of Combining Systems. pp. 1–56, Kluwer.Google Scholar
- Gabbay, D. M.: 1998, Fibring Logics Oxford University Press.Google Scholar
- Gabbay, D. M. and H. J. Ohlbach: 1992, `Quantifier elimination in second—order predicate logic’. In: B. Nebel, C. Rich, and W. Swartout (eds.): Principles of Knowledge Representation and Reasoning (KR92). pp. 425–435, Morgan Kaufmann.Google Scholar
- Stone, M. H.: 1936, `The Theory of Representations for Boolean Algebras’. Transactions of American Mathematical Society 40, 37–111.Google Scholar