In this paper a sequent calculus is proposed for the modal logic GLlin and the cut-elimination theorem as well as some of its main consequences are proven
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalg...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
AbstractFor some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elim...
A syntactic proof of cut-elimination yields a procedure to eliminate every instance the cut-rule fro...
A well established technique toward developing the proof theory of a Hilbert-style modal logic is to...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics...
We develop a general criterion for cut elimination in sequent calculi forpropositional modal logics,...
Motivated by the fact that nearly all conditional logics are axiomatised by so-called shallow axioms...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
... This paper introduces a systematic presentation for the systems K, D, M, S4, and S5 in the cal...
We propose an extension of the Gentzen sequent calculus in order to deal with modalities. We extend ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalg...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
AbstractFor some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elim...
A syntactic proof of cut-elimination yields a procedure to eliminate every instance the cut-rule fro...
A well established technique toward developing the proof theory of a Hilbert-style modal logic is to...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics...
We develop a general criterion for cut elimination in sequent calculi forpropositional modal logics,...
Motivated by the fact that nearly all conditional logics are axiomatised by so-called shallow axioms...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
... This paper introduces a systematic presentation for the systems K, D, M, S4, and S5 in the cal...
We propose an extension of the Gentzen sequent calculus in order to deal with modalities. We extend ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalg...
Recently, Brighton gave another cut-admissibility proof for the standard set-based sequent calculus ...
DOI
Add to ORKG