Review: Thomas H. Mott, Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants; D. M. Y. Chang, T. H. Mott, Computing Irredundant Normal Forms from Abbreviated Presence Functions [Book Review]

Journal of Symbolic Logic 32 (4):541-542 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1968

DOI

10.2307/2270231

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants.Thomas H. Mott, D. M. Y. Chang & T. H. Mott - 1967 - Journal of Symbolic Logic 32 (4):541-542.
Gazalé M. J. Ghazala. Irredundant disjunctive and conjunctive forms of a Boolean function. IBM journal of research and development, vol. 1 , pp. 171–176.Rado T.. Comments on the presence function of Gazalé. IBM journal of research and development, vol. 6 , pp. 268–269. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (1):106-109.
IBM Journal of Research and Development: Irredundant Disjunctive and Conjunctive Forms of a Boolean Function.M. J. Ghazala & T. Rado - 1965 - Journal of Symbolic Logic 30 (1):106-109.
On Cores and Prime Implicants of Truth Functions.W. V. Quine - 1970 - Journal of Symbolic Logic 35 (2):329-330.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
A combinatory account of internal structure.Barry Jay & Thomas Given-Wilson - 2011 - Journal of Symbolic Logic 76 (3):807 - 826.
R. H. Urbano and R. K. Mueller. A topological method for the determination of the minimal forms of a Boolean function. Transactions of the IRE Professional. Group on Electronic Computers, vol. EC-5 no. 3 , pp. 126–132. - David M. Brender. The logical procedures needed for finding the minimals of a Boolean function on a digital computer. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, p. 210. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (4):368-370.
R. H. Urbano and R. K. Mueller. A topological method for the determination of the minimal forms of a Boolean function. Transactions of the IRE Professional. Group on Electronic Computers, vol. EC-5 no. 3 , pp. 126–132. - David M. Brender. The logical procedures needed for finding the minimals of a Boolean function on a digital computer. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, p. 210. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (4):370-373.
Review: V. K. Detlovs, The Equivalence of Normal Algorithms and Recursive Functions. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-362.

Analytics

Added to PP
2013-11-22

Downloads
32 (#718,209)

6 months
8 (#633,132)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references