Weak simplest normal truth functions
From MaRDI portal
Publication:3228600
Cited in
(5)- The automation of syllogistic. I: Syllogistic normal forms
- An application of truth functional logic to concept-attainment experiments
- Quinean Minimization: Some Suggested Modifications
- A Method of Two-Level Simplification of Boolean Functions
- A generalization of Nelson's algorithm for obtaining prime implicants
This page was built for publication: Weak simplest normal truth functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3228600)