R. W. House and T. Rado. A generalization of Nelson's algorithm for obtaining prime implicants. The journal of symbolic logic, vol. 30 , pp. 8–12 [Book Review]

Journal of Symbolic Logic 32 (2):265-265 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271687

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

A generalization of Nelson's algorithm for obtaining prime implicants.R. W. House & T. Rado - 1965 - Journal of Symbolic Logic 30 (1):8-12.
A Generalization of Nelson's Algorithm for Obtaining Prime Implicants.R. W. House & T. Rado - 1967 - Journal of Symbolic Logic 32 (2):265-265.
Review: R. W. House, T. Rado, On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):264-265.
House R. W. and Rado T.. On a computer program for obtaining irreducible representations for two-level multiple input-output logical systems. Journal of the Association for Computing Machinery, vol. 10 , pp. 48–77. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):264-265.
Quine W. V.. On cores and prime implicants of truth functions. Selected logic papers, Random House, New York 1966, pp. 164–171. , pp. 755–760.). [REVIEW]S. Rudeanu - 1970 - Journal of Symbolic Logic 35 (2):329-330.
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.
On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems.R. W. House & T. Rado - 1967 - Journal of Symbolic Logic 32 (2):264-265.
On Cores and Prime Implicants of Truth Functions.W. V. Quine - 1970 - Journal of Symbolic Logic 35 (2):329-330.
Review: W. V. Quine, On Cores and Prime Implicants of Truth Functions. [REVIEW]S. Rudeanu - 1970 - Journal of Symbolic Logic 35 (2):329-330.
Review: E. J. McCluskey, H. Schorr, Essential Multiple-Output Prime Implicants. [REVIEW]S. Rudeanu - 1970 - Journal of Symbolic Logic 35 (3):483-483.
Variations of Rado's lemma.Paul Howard - 1993 - Mathematical Logic Quarterly 39 (1):353-356.
Canonical partition relations.James E. Baumgartner - 1975 - Journal of Symbolic Logic 40 (4):541-554.
Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
A temporal negative normal form which preserves implicants and implicates.Pablo Cordero, Manuel Enciso & Inma P. de Guzmán - 2000 - Journal of Applied Non-Classical Logics 10 (3):243-272.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.

Analytics

Added to PP
2013-11-03

Downloads
19 (#821,202)

6 months
1 (#1,508,101)

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