On Closed Subsets of Boolean Functions (A New Proof for Post's Theorem).
Dietlinde LauPublished in: J. Inf. Process. Cybern. (1991)
Keyphrases
- boolean functions
- interactive theorem proving
- uniform distribution
- threshold functions
- dnf formulae
- prime implicants
- functional properties
- disjunctive normal form
- relevant variables
- multi valued
- theorem proving
- read once formulas
- theorem prover
- association rules
- bi decomposition
- multi class
- binary decision diagrams
- queueing networks
- truth table
- upper bound