Visualizing Boolean operations on a hypercube
| Autor: | M. C. Clarke |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Discrete mathematics
Product term Parity function Two-element Boolean algebra Boolean circuit Boolean algebras canonically defined Boolean algebra Computer Science Applications Combinatorics symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer Science::Logic in Computer Science Modeling and Simulation Modelling and Simulation symbols Boolean expression Boolean function Computer Science::Databases Mathematics |
| Zdroj: | Mathematical and Computer Modelling. 20(9):97-103 |
| ISSN: | 0895-7177 |
| DOI: | 10.1016/0895-7177(94)00166-9 |
| Popis: | Although it is known that every Boolean function can be represented as a subgraph of a hypercube [1], the implications of this fact have been little explored. We show a method for constructing such graphs which allows any formula of propositional logic to be visually represented. Boolean operations can be defined as manipulations of such graphs. A simple method is shown whereby the validity of propositional sequents may be checked. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|