Cut Might Cautiously

Logic Journal of the IGPL 3 (2-3):191-202 (1995)
  Copy   BIBTEX

Abstract

This note is on cautious cut elimination for one of Veitman's might logics. Syntactically, the logic is presented as an extension of a sequent system for classical proposition logic . I show that this extension preserves the completeness and decidability of CPL. The proof has cautious cut elimination as a corollary. I also give a rather general syntactic proof of cautious cut elimination. It states that any ‘base’ logic which has a reflexive, monotone consequence relation that allows cautious cut to be eliminated preserves cautious cut elimination when extended to a might logic.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,934

External links

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

Through your library

Analytics

Added to PP
2014-01-22

Downloads
26 (#867,332)

6 months
12 (#325,295)

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