The strong decidability of cut-logics. I. Partial propositional calculi

Notre Dame Journal of Formal Logic 12 (3):322-328 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093894295

Other Versions

No versions found

Links

PhilArchive

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

Cut-free tableau calculi for some propositional normal modal logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359-372.
The strong decidability of cut logics. II. Generalizations.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (4):429-434.
Display calculi for logics with relative accessibility relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.
Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
Cut-free tableau calculi for some intuitionistic modal logics.Mauro Ferrari - 1997 - Studia Logica 59 (3):303-330.
Translations and structure for partial propositional calculi.E. William Chapin - 1974 - Studia Logica 33 (1):35-57.
Translations and Structure for Partial Propositional Calculi.E. William Chapin Jr - 1974 - Studia Logica 33 (1):35 - 57.
Decidability of quantified propositional intuitionistic logic and s4 on trees of height and arity ≤ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
A Mechanization of Strong Kleene Logic for Partial Functions.Manfred Kerber Michael Kohlhase - unknown

Analytics

Added to PP
2010-08-24

Downloads
79 (#724,897)

6 months
13 (#895,072)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The strong decidability of cut logics. II. Generalizations.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (4):429-434.

Add more citations

References found in this work

A detailed argument for the Post-Linial theorems.Mary Katherine Yntema - 1964 - Notre Dame Journal of Formal Logic 5 (1):37-50.
Gentzen-like systems for partial propositional calculi. I.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (1):75-80.
Gentzen-like systems for partial propositional calculi. II.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (2):179-182.

Add more references