论文信息 - Irredundant Disjunctive and Conjunctive Forms of a Boolean Function

Irredundant Disjunctive and Conjunctive Forms of a Boolean Function

A thorough algebraic method is described for the determination of the complete set of irredundant normal and conjunctive forms of a Boolean function. The method is mechanical and therefore highly programmable on a computer.

Midhat J. Ghazala

[1] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .

[2] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .

[3] D. B. Houghton. Synthesis of electronic computing and control circuits: Vol. 27 of The Annals of the Computation Laboratory of Harvard University, 278 pages, diagrams, 20 × 27 cm. Cambridge, Harvard University Press, 1951. Price, $8.00 , 1952 .

[4] Claude E. Shannon,et al. A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[5] Raymond J. Nelson,et al. Simplest normal truth functions , 1955, Journal of Symbolic Logic.

[6] Rocco H. Urbano,et al. A Topological Method for the Determination of the Minimal Forms of a Boolean Function , 1956, IRE Trans. Electron. Comput..

[7] E. W. Veitch,et al. A chart method for simplifying truth functions , 1952, ACM '52.