The problem of simplifying logical expressions

&
Journal of Symbolic Logic 24 (1):17-19 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964570

Links

PhilArchive



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

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

Dunham B. and Fridshal R.. The problem of simplifying logical expressions. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (3):300-300.
Review: B. Dunham, R. Fridshal, The Problem of Simplifying Logical Expressions. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (3):300-300.
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.
B. Dunham, R. Fridshal, and G. L. Sward. A non-heuristic program for proving elementary logical theorems. English, with French, German, Russian, and Spanish summaries. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, and Butterworths, London, 1960, pp. 282–285. - B. Dunham, R. Fridshal, and J. H. North. Exploratory mathematics by machine. Recent developments in information and decision processes, edited by Robert E. Machol and Paul Gray, The Macmillan Company, New York1962, pp. 149–160. - B. Dunham and J. H. North. Theorem testing by computer. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N. Y., April 24, 25, 26, 1962, Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 173–177. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266-266.
Review: R. Fridshal, The Quine Algorithm. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-103.
Review: A. Cobham, R. Fridshal, J. H. North, An Application of Linear Programming to the Minimization of Boolean Functions. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (2):247-247.
Fridshal R.. The Quine algorithm. 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, pp. 211–212. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-103.
Curry H. B.. On the use of dots as brackets in logical expressions.Everett J. Nelson - 1937 - Journal of Symbolic Logic 2 (2):90-91.
Review: H. B. Curry, On the use of Dots as Brackets in Logical Expressions. [REVIEW]Everett J. Nelson - 1937 - Journal of Symbolic Logic 2 (2):90-91.
Dunham B.. The formalization of scientific languages. Part I. The work of Woodger and Hull. IBM journal of research and development, vol. 1 , pp. 341–348. [REVIEW]George L. Alexander - 1958 - Journal of Symbolic Logic 23 (3):352-352.

Analytics

Added to PP
2009-01-28

Downloads
129 (#140,280)

6 months
128 (#37,127)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Towards feasible solutions of the tautology problem.Bradford Dunham & Hao Wang - 1976 - Annals of Mathematical Logic 10 (2):117-154.

Add more citations

References found in this work

No references found.

Add more references