J. W. Swanson. A reduction theorem for normal algorithms. The journal of symbolic logic, vol. 31 , pp. 86–97

Journal of Symbolic Logic 32 (1):123 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271278

Links

PhilArchive



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

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: J. W. Swanson, A Reduction Theorem for Normal Algorithms. [REVIEW]Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123-123.
A reduction theorem for normal algorithms.J. W. Swanson - 1966 - Journal of Symbolic Logic 31 (1):86-97.
A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13‐15):219-222.
Towards Strengthening of the Reduction Theorem of the Theory of Algorithms.N. M. Nagornyj - 1954 - Journal of Symbolic Logic 19 (3):218-218.
Review: N. M. Nagornyj, Towards Strengthening of the Reduction Theorem of the Theory of Algorithms. [REVIEW]Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (3):218-218.
On Simplification Algorithms for Disjunctive Normal Forms.E. Mendelson - 1966 - Journal of Symbolic Logic 31 (1):141-141.
A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13-15):219-222.
I. Žuravlév Ú.. O névozmožnosti postroéniá minimal'nyh dizúnktivnyh normal'nyh form funkcij algébry logiki v odnom kassé algoritmov. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 504–506.Žuravlev Yu. I.. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 581–583. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):379-379.
Review: Yu. I. Zuravlev, E. Mendelson, On Simplification Algorithms for Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
Ú. I. Žuravlév. Ob algoritmahj uproščéniá dizúnktivnyh normal′nyh form. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 260–263. - Yu. I. Žuravlev. On simplification algorithms for disjunctive normal forms. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 526–529. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
Review: John G. Kemeny, Paul Oppenheim, On Reduction. [REVIEW]J. W. Swanson - 1968 - Journal of Symbolic Logic 33 (2):316-317.
A normal form theorem for first order formulas and its application to Gaifman's splitting theorem.Nobuyoshi Motohashi - 1984 - Journal of Symbolic Logic 49 (4):1262-1267.
John G. Kemeny and Paul Oppenheim. On reduction. Philosophical studies , vol. 7 , pp. 6–19.J. W. Swanson - 1968 - Journal of Symbolic Logic 33 (2):316-317.
Bruce Lercher. Strong reduction and normal form in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 213–223.Luis E. Sanchis - 1971 - Journal of Symbolic Logic 36 (1):171.
Logic and Algorithms with Applications to the Computer and Information Sciences.Robert R. Korfhage - 1971 - Journal of Symbolic Logic 36 (2):344-346.

Analytics

Added to PP
2016-06-30

Downloads
27 (#557,528)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references