Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the explanation of the rules
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
Dragalin in his book on Mathematical Intuitionism has given an outline proof of the admissibility of...
This paper presents a uniform and modular method to prove uniform interpolation for several intermed...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
We consider a general format for sequent rules for not necessarily normal modal logics based on clas...
Neighbourhood semantics for intuitionistic logic extended with countable conjunctions and disjunctio...
Abstract. We consider a general format for rules for not necessarily normal modal logics based on cl...
summary:The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is c...
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual...
In this paper we present a labelled sequent system for intuitionistic modal logics such that there i...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
International audienceBounded depth refers to a property of Kripke frames that serve as semantics fo...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
Dragalin in his book on Mathematical Intuitionism has given an outline proof of the admissibility of...
This paper presents a uniform and modular method to prove uniform interpolation for several intermed...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
We consider a general format for sequent rules for not necessarily normal modal logics based on clas...
Neighbourhood semantics for intuitionistic logic extended with countable conjunctions and disjunctio...
Abstract. We consider a general format for rules for not necessarily normal modal logics based on cl...
summary:The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is c...
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual...
In this paper we present a labelled sequent system for intuitionistic modal logics such that there i...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
International audienceBounded depth refers to a property of Kripke frames that serve as semantics fo...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
Dragalin in his book on Mathematical Intuitionism has given an outline proof of the admissibility of...
This paper presents a uniform and modular method to prove uniform interpolation for several intermed...