This paper presents sequent calculi in which proof search is terminating for two intuitionistic modal logics, the intuitionistic versions of the classical modal logics K and KD without a diamond operator. The calculi are extensions of the terminating sequent calculus G4ip for intuitionistic propositional logic that was discovered independently by Dyckhoff and Hudelmaier around 1990. It is shown by proof–theoretic means that these terminating calculi are equivalent to the cutfree extensions of G3ip that form some of the standard calculi for intuitionistic modal logics
Fitting's indexed nested sequents can be used to give deductive systems to modal logics which cannot...
This paper develops sequent calculi for several classical modal logics. Utilizing a polymodal transl...
Possible world semantics underlies many of the applications of modal logic in computer science and p...
This paper presents sequent calculi in which proof search is terminating for two intuitionistic moda...
This paper provides a study of sequent calculi for intuitionistic Gödel-Löb logic (iGL), which is th...
summary:The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is c...
A novel countermodel-producing decision procedure that applies to several multi-modal logics, both i...
This paper presents a uniform and modular method to prove uniform interpolation for several intermed...
International audienceIn this article we define label-free sequent calculi for the intuitionistic mo...
We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating bac...
In this paper we present two calculi for intuitionistic logic. The first one, IG, is characterized b...
In this paper we present a labelled sequent system for intuitionistic modal logics such that there i...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
This approach to studying the minimal intuitionistic modal logic is based on a generalization of Gen...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
Fitting's indexed nested sequents can be used to give deductive systems to modal logics which cannot...
This paper develops sequent calculi for several classical modal logics. Utilizing a polymodal transl...
Possible world semantics underlies many of the applications of modal logic in computer science and p...
This paper presents sequent calculi in which proof search is terminating for two intuitionistic moda...
This paper provides a study of sequent calculi for intuitionistic Gödel-Löb logic (iGL), which is th...
summary:The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is c...
A novel countermodel-producing decision procedure that applies to several multi-modal logics, both i...
This paper presents a uniform and modular method to prove uniform interpolation for several intermed...
International audienceIn this article we define label-free sequent calculi for the intuitionistic mo...
We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating bac...
In this paper we present two calculi for intuitionistic logic. The first one, IG, is characterized b...
In this paper we present a labelled sequent system for intuitionistic modal logics such that there i...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
This approach to studying the minimal intuitionistic modal logic is based on a generalization of Gen...
A language of constructions for minimal logic is the -calculus, where cut-elimination is encoded as ...
Fitting's indexed nested sequents can be used to give deductive systems to modal logics which cannot...
This paper develops sequent calculi for several classical modal logics. Utilizing a polymodal transl...
Possible world semantics underlies many of the applications of modal logic in computer science and p...