Errata to Cambridge Computer Laboratory technical report number 257: Cut-free sequent and tableau systems for propositional normal modal logics by

Abstract

The main technical errors are in the literature survey. On pages 44, 93-94, 131 and 133 I claim that Fitting's and/or Rautenberg's systems are incomplete because they omit contraction. The claim is wrong because contraction is implicit in their set notation. Their systems are complete because they allow contraction on any formula whereas the systems in this technical report explicitly build contraction into certain rules, allowing contraction only on certain types of formulae. Please accept my apologies for any confusion this causes you.

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Cut-free sequent and tableau systems for propositional diodorean modal logics.Rajeev Goré - 1994 - Studia Logica 53 (3):433 - 457.
Cut-free tableau calculi for some propositional normal modal logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
Admissibility of structural rules for contraction-free systems of intuitionistic logic.Roy Dyckhoff & Sara Negri - 2000 - Journal of Symbolic Logic 65 (4):1499-1518.
Analytic tableau systems and interpolation for the modal logics KB, KDB, k5, KD.Linh Anh Nguyen - 2001 - Studia Logica 69 (1):41-57.
Prefixed tableaus and nested sequents.Melvin Fitting - 2012 - Annals of Pure and Applied Logic 163 (3):291 - 313.
Sequent-systems and groupoid models. I.Kosta Došen - 1988 - Studia Logica 47 (4):353 - 385.
Connectification forn-contraction.Andreja Prijatelj - 1995 - Studia Logica 54 (2):149 - 171.
Cut-free tableau calculi for some intuitionistic modal logics.Mauro Ferrari - 1997 - Studia Logica 59 (3):303-330.
A tableau calculus with automaton-labelled formulae for regular grammar logics.Rajeev Gore - unknown
Modal Extensions of Sub-classical Logics for Recovering Classical Logic.Marcelo E. Coniglio & Newton M. Peron - 2013 - Logica Universalis 7 (1):71-86.
Four simple systems of modal propositional logic.Gerald J. Massey - 1965 - Philosophy of Science 32 (3/4):342-355.
Comparing modal sequent systems.Greg Restall - unknown
Sequent calculus in natural deduction style.Sara Negri & Jan von Plato - 2001 - Journal of Symbolic Logic 66 (4):1803-1816.

Analytics

Added to PP
2010-12-22

Downloads
14 (#968,362)

6 months
1 (#1,516,429)

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