In this paper we present LSJ, a contraction-free sequent calculus for Intuitionistic propositional logic whose proofs are linearly bounded in the length of the formula to be proved and satisfy the subformula property. We also introduce a sequent calculus RJ for intuitionistic unprovability with the same properties of LSJ. We show that from a refutation of RJ of a sequent σ we can extract a Kripke counter-model for σ. Finally, we provide a procedure that given a sequent σ returns either a proof of σ in LSJ or a refutation in RJ such that the extracted counter-model is of minimal depth. © 2012 Springer Science+Business Media B.V.

Ferrari, M., Fiorentini, C., Fiorino, G. (2013). Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. JOURNAL OF AUTOMATED REASONING, 51(2), 129-149 [10.1007/s10817-012-9252-7].

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models

FIORINO, GUIDO GIUSEPPE
2013

Abstract

In this paper we present LSJ, a contraction-free sequent calculus for Intuitionistic propositional logic whose proofs are linearly bounded in the length of the formula to be proved and satisfy the subformula property. We also introduce a sequent calculus RJ for intuitionistic unprovability with the same properties of LSJ. We show that from a refutation of RJ of a sequent σ we can extract a Kripke counter-model for σ. Finally, we provide a procedure that given a sequent σ returns either a proof of σ in LSJ or a refutation in RJ such that the extracted counter-model is of minimal depth. © 2012 Springer Science+Business Media B.V.
Articolo in rivista - Articolo scientifico
Intuitionistic propositional logic; Sequent calculi; Subformula property; Decision procedures; Counter-models generation
English
10-giu-2012
2013
51
2
129
149
none
Ferrari, M., Fiorentini, C., Fiorino, G. (2013). Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. JOURNAL OF AUTOMATED REASONING, 51(2), 129-149 [10.1007/s10817-012-9252-7].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/39123
Citazioni
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 20
Social impact