Burkhart W. H.. Theorem minimization. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 259–263 [Book Review]

Journal of Symbolic Logic 18 (4):348-348 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2266603

Links

PhilArchive



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

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

E. W. Veitch. A chart method for simplifying truth functions. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh1952, pp. 127–133. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
J. A. Robinson. Theorem-proving on the computer. Journal of the Association for Computing Machinery, vol. 10 , pp. 163–174. [REVIEW]David Luckham - 1966 - Journal of Symbolic Logic 31 (3):514-515.
J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, vol. 12 , pp. 23–41. [REVIEW]David Luckham - 1966 - Journal of Symbolic Logic 31 (3):515-516.
Review: W. H. Burkhart, Theorem Minimization. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
Carnegie Mellon University, Pittsburgh, PA May 19–23, 2004.John Baldwin, Lev Beklemishev, Michael Hallett, Valentina Harizanov, Steve Jackson, Kenneth Kunen, Angus J. MacIntyre, Penelope Maddy, Joe Miller & Michael Rathjen - 2005 - Bulletin of Symbolic Logic 11 (1).
Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Manuel Blum - 1970 - Journal of Symbolic Logic 34 (4):657-658.
Lessons from a restricted Turing test.Stuart M. Shieber - 1994 - Communications of the Association for Computing Machinery 37:70-82.
Computer science as empirical inquiry: Symbols and search.Allen Newell & Herbert A. Simon - 1981 - Communications of the Association for Computing Machinery 19:113-26.
The Foundations of Computing Machinery. Part II.John D. Goodell - 1953 - Journal of Symbolic Logic 18 (4):348-349.
Notes on the Turing test.C. Crawford - 1994 - Communications of the Association for Computing Machinery 37 (June):13-15.

Analytics

Added to PP
2016-06-30

Downloads
15 (#976,359)

6 months
4 (#862,833)

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