Conference Paper

A Unified Sequent Calculus for Focused Proofs.

DOI: 10.1109/LICS.2009.47 Conference: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA
Source: DBLP

ABSTRACT We present a compact sequent calculus LKU for classical logic organized around the concept of polarization. Focused sequent calculi for classical logic, intuitionistic logic, and multiplicative-additive linear logic are derived as fragments of LKU by increasing the sensitivity of specialized structural rules to polarity information. We develop a unified, streamlined framework for proving cut-elimination in the various fragments. Furthermore, each sublogic can interact with other fragments through cut. We also consider the possibility of introducing classical-linear hybrid logics.

Download full-text

Full-text

Available from: Dale Miller, Jun 20, 2015
0 Followers
 · 
105 Views
  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: Proof search in inference systems such as the sequent calculus is a process of discovery. Once a proof is found, there is often information in the proof which is redundant. In this article we show how to detect and eliminate certain kinds of redundant formulae from a given proof, and in particular in a way which does not require further proof search or any rearrangement of the proof found. Our technique involves adding constraints to the inference rules, which are used once the proof is complete to determine redundant formulae and how they may be eliminated. We show how this technique can be applied to propositional linear logic, and prove its correctness for this logic. We also discuss how our approach can be extended to other logics without much change.
    Journal of Logic and Computation 02/2014; 24(1). DOI:10.1093/logcom/ext007 · 0.50 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a compact sequent calculus LKU for classical logic organized around the concept of polarization. Focused sequent calculi for classical, intuitionistic, and multiplicative–additive linear logics are derived as fragments of the host system by varying the sensitivity of specialized structural rules to polarity information. We identify a general set of criteria under which cut-elimination holds in such fragments. From cut-elimination we derive a unified proof of the completeness of focusing. Furthermore, each sublogic can interact with other fragments through cut. We examine certain circumstances, for example, in which a classical lemma can be used in an intuitionistic proof while preserving intuitionistic provability. We also examine the possibility of defining classical–linear hybrid logics.
    Annals of Pure and Applied Logic 09/2011; DOI:10.1016/j.apal.2011.01.012 · 0.45 Impact Factor