Simplest normal truth functions

DOI10.2307/2266893zbMATH Open0066.25602OpenAlexW2016492815MaRDI QIDQ3226744FDOQ3226744

Authors: R. J. Nelson 

Publication date: 1955

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2266893

zbMATH Keywords

philosophy and foundations of mathematics

Cites Work

• The Problem of Simplifying Truth Functions

Cited In (7)

• Algebraic Topological Methods for the Synthesis of Switching Systems. I
• Polynomial-time algorithms for generation of prime implicants
• McColl and minimization
• A Method of Two-Level Simplification of Boolean Functions
• Boolean function minimization in the class of disjunctive normal forms
• On finding optimal covers
• An algorithm to generate prime implicants and its application to the selection problem

This page was built for publication: Simplest normal truth functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3226744)