The strong decidability of cut logics. II. Generalizations

Notre Dame Journal of Formal Logic 12 (4):429-434 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093894363

Links

PhilArchive



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

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

The strong decidability of cut-logics. I. Partial propositional calculi.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (3):322-328.
Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
Decidability by filtrations for graded normal logics (graded modalities V).Claudio Cerrato - 1994 - Studia Logica 53 (1):61 - 73.
On extensions of intermediate logics by strong negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
Cut and pay.Marcelo Finger & Dov Gabbay - 2006 - Journal of Logic, Language and Information 15 (3):195-218.
Substructural logics with Mingle.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (2):227-249.
Cut-free tableau calculi for some propositional normal modal logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
On decision procedures for sentential logics.Tomasz Skura - 1991 - Studia Logica 50 (2):173 - 179.
Completeness and decidability results for some propositional modal logics containing “actually” operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
On modal logics characterized by models with relative accessibility relations: Part I.Stéphane Demri & Dov Gabbay - 2000 - Studia Logica 65 (3):323-353.
Displaying and deciding substructural logics 1: Logics with contraposition.Greg Restall - 1998 - Journal of Philosophical Logic 27 (2):179-216.
On modal logics characterized by models with relative accessibility relations: Part II.Stéphane Demri & Dov Gabbay - 2000 - Studia Logica 66 (3):349-384.
The Craig interpolation theorem for prepositional logics with strong negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
Display calculi for logics with relative accessibility relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.

Analytics

Added to PP
2010-08-24

Downloads
19 (#796,059)

6 months
9 (#302,300)

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