E. William ChapinJr., Gentzen-like systems for partial propositional calculi. Notre Dame journal of formal logic, vol. 12 , pp. 75–80, and pp. 179–182 [Book Review]

Journal of Symbolic Logic 40 (3):469 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272211

Links

PhilArchive



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

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

Gentzen-like systems for partial propositional calculi. II.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (2):179-182.
Gentzen-like systems for partial propositional calculi. I.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (1):75-80.
Review: E. William Chapin, Gentzen-Like Systems for Partial Propositional Calculi. [REVIEW]K. Iseki - 1975 - Journal of Symbolic Logic 40 (3):469-469.
The strong decidability of cut-logics. I. Partial propositional calculi.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (3):322-328.
Many-one degrees associated with partial propositional calculi.W. E. Singletary - 1974 - Notre Dame Journal of Formal Logic 15 (2):335-343.
Gentzen-Like Systems for Partial Propositional Calculi.K. Iséki - 1975 - Journal of Symbolic Logic 40 (3):469-469.
Results regarding the axiomatization of partial propositional calculi.W. E. Singletary - 1968 - Notre Dame Journal of Formal Logic 9 (3):193-211.
On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.D. Bollman & M. Tapia - 1972 - Notre Dame Journal of Formal Logic 13 (1):124-128.
Probabilistic Canonical Models for Partial Logics.François Lepage & Charles Morgan - 2003 - Notre Dame Journal of Formal Logic 44 (3):125-138.
Propositional sequence-calculi for inconsistent systems.Andrés R. Raggio - 1968 - Notre Dame Journal of Formal Logic 9 (4):359-366.
Generalizability of the propositional and predicate calculi to infinite-valued calculi.Hermann F. Schott - 1970 - Notre Dame Journal of Formal Logic 11 (1):107-128.
Sequent Calculi for Visser's Propositional Logics.Kentaro Kikuchi & Ryo Kashima - 2001 - Notre Dame Journal of Formal Logic 42 (1):1-22.
A Simulation of Natural Deduction and Gentzen Sequent Calculus.Daniil Kozhemiachenko - 2018 - Logic and Logical Philosophy 27 (1):67-84.
Bolesław Sobociński. Certain extensions of modal system S4. Notre Dame journal of formal logic, vol. 11 no. 3 , pp. 347–368. - Bolesław Sobociński. Concerning some extensions of S4. Notre Dame journal of formal logic, vol. 12 , pp. 363–370. - G. F. Schumm. Solutions to four modal problems of Sobocinski. Notre Dame journal of formal logic, vol. 12 , pp. 335–340. - J. Jay Zeman. A study of some systems in the neighborhood of S4.4. Notre Dame journal of formal logic, vol. 12 , pp. 341–357. - Bolesław Sobociński. A new class of modal systems. Notre Dame journal of formal logic, vol. 12 , pp. 371–377. - Bolesław Sobociński. A proper subsystem of S4.04. Notre Dame journal of formal logic, vol. 12 , pp. 381–384. [REVIEW]M. J. Cresswell - 1975 - Journal of Symbolic Logic 40 (4):602.
Involution as a basis for propositional calculi.M. B. Smyth - 1974 - Notre Dame Journal of Formal Logic 15 (4):569-588.

Analytics

Added to PP
2016-06-30

Downloads
21 (#718,251)

6 months
2 (#1,232,442)

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