Henry C. Byerly and Charles J. Merchant. New algorithms for the statement and class calculi. Notre Dame journal of formal logic, vol. 11 , pp. 229–240 [Book Review]

Journal of Symbolic Logic 39 (2):362 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

New algorithms for the statement and class calculi.Henry C. Byerly & Charles J. Merchant - 1970 - Notre Dame Journal of Formal Logic 11 (2):229-240.
A semantical analysis of the calculi Cn.Newton C. A. da Costa - 1977 - Notre Dame Journal of Formal Logic 18:621.
Definitional Boolean calculi.Richard Cole - 1968 - Notre Dame Journal of Formal Logic 9 (4):343-350.
Involution as a basis for propositional calculi.M. B. Smyth - 1974 - Notre Dame Journal of Formal Logic 15 (4):569-588.
A semantical Analysis of the Calculi C n.Newton C. A. Costa - 1977 - Notre Dame Journal Fo Formal Logic 18:621-630.
Some complete calculi of individuals.Rolf A. Eberle - 1967 - Notre Dame Journal of Formal Logic 8 (4):267-278.
The decidability of one-variable propositional calculi.M. D. Gladstone - 1979 - Notre Dame Journal of Formal Logic 20 (2):438-450.

Analytics

Added to PP
2016-06-30

Downloads
30 (#528,361)

6 months
4 (#779,417)

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