On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271686

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

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

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.
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. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):265-265.
[Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
omnibus Review. [REVIEW]James Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):698-701.
Review: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
Formalizing GDPR Provisions in Reified I/O Logic: The DAPRECO Knowledge Base.Livio Robaldo, Cesare Bartolini, Monica Palmirani, Arianna Rossi, Michele Martoni & Gabriele Lenzini - 2020 - Journal of Logic, Language and Information 29 (4):401-449.
Review: B. Dunham, R. Fridshal, G. L. Sward, A Non-Heuristic Program for Proving Elementary Logical Theorems; B. Dunham, R. Fridshal, J. H. North, Exploratory Mathematics by Machine; B. Dunham, J. H. North, Theorem Testing by Computer. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266-266.
Rado T.. On non-computable functions. The Bell System technical journal, vol. 41 , pp. 877–884.F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
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.

Analytics

Added to PP
2015-02-05

Downloads
2 (#1,450,151)

6 months
2 (#1,816,284)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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