Peter B. Andrews. Resolution with merging. Journal of the Association for Computing Machinery, vol. 15 , pp. 367–381

Journal of Symbolic Logic 35 (1):159-160 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s0022481200092872

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

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: Peter B. Andrews, Resolution with Merging. [REVIEW]David Luckham - 1970 - Journal of Symbolic Logic 35 (1):159-160.
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.
Resolution with Merging.Peter B. Andrews - 1970 - Journal of Symbolic Logic 35 (1):159-160.
Wang Hao. Tag systems and lag systems. Mathematische Annalen, vol. 152 , pp. 65–74.Cocke John and Minsky Marvin. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 , pp. 15–20.Cook Stephen A.. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 , pp. 223–225. [REVIEW]Ann Yasuhara - 1971 - Journal of Symbolic Logic 36 (2):344.
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. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
Burkhart W. H.. A method for synthesis of two-valued feedback circuits. 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. 265–272. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
Semon Warren L.. Characteristic numbers and their use in the decomposition of switching 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, Pittsburgh 1952, pp. 273–280. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):57-57.
Kalin Theodore A.. Formal logic and switching circuits. 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. 251–257. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (4):345-346.
James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, vol. 14 , pp. 687–697. [REVIEW]Lawrence T. Wos - 1970 - Journal of Symbolic Logic 35 (4):595-596.
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.
Seymour Ginsburg and Joseph Ullian. Ambiguity in context free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 62–89. - Seymour Ginsburg and Joseph Ullian. Preservation of unambiguity and inherent ambiguity in context-free languages.Journal of the Association for Computing Machinery, vol. 13 , pp. 364–368. - Thomas N. Hibbard and Joseph Ullian, The independence of inherent ambiguity from complementedness among context-free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 588–593. [REVIEW]D. Terence Langendoen - 1968 - Journal of Symbolic Logic 33 (2):301-302.
Jeffrey Richard C.. Arithmetical analysis of digital computing nets. Journal of the Association for Computing Machinery, vol. 3 , pp. 360–375. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (2):190-191.
Elgot Calvin C.. On single vs. triple address computing machines. Journal of the Association for Computing Machinery, vol. 1 no. 3 , pp. 119–123. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):208-209.
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 , pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 , pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 , pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
H. Allen Curtis. A functional canonical form. Journal of the Association for Computing Machinery, vol. 6 , pp. 245–258. - H. Allen Curtis. Multifunctional circuits in functional canonical form. Journal of the Association for Computing Machinery, vol. 6 , pp. 538–547. - H. Allen Curtis. A new approach to the design of switching circuits. D. Van Nostrand Company, Inc., Princeton-Toronto-London-New York, 1962, viii + 635 pp. - R. L. Ashenhurst. The decomposition of switching functions. Therein, pp. 571–602. - Theodore Singer. The decomposition chart as a theoretical aid. Therein, pp. 602–620. [REVIEW]Harold S. Stone - 1972 - Journal of Symbolic Logic 37 (4):760-762.

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,084,326)

6 months
1 (#1,469,946)

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