Add to ORKGWe introduce a tableau calculus for Haíek’s Basic Logic BL. This calculus has many of the desirable properties of a proof system: it is cut-free, it has the subformula property, correctness of proof can be checked in P-time, and the number of symbols in any branch of the reduction tree of any sequent Gamma is polynomial in the number of symbols of Gamma. As a corollary we obtain an alternative proof of  co-NP completeness of BL
The logic of proofs (lp) was proposed as Gdels missed link between Intuitionistic and S4-proofs, but...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
International audienceWe analyze different features related to the mechanization of von Wright's log...
We introduce a tableau calculus for Hajek's Basic Logic BL. This calculus has many of the desirable ...
The current first-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus whic...
Abstract. We present a sound and complete tableau calculus for the class of regular grammar logics. ...
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tablea...
Since 1993, when Hudelmaier developed an O(n log n)-space decision procedure for propositional Intui...
for the predicate calculus as to obtain a direct proof (without using compactness) of the fact that ...
We introduce a proof system for H´ ajek’s logic BL based on a relational hypersequents framework. W...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
This paper presents a tableau based proof technique that is suitable for proving theorems in the two...
The logic of proofs (lp) was proposed as Gdels missed link between Intuitionistic and S4-proofs, but...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
International audienceWe analyze different features related to the mechanization of von Wright's log...
We introduce a tableau calculus for Hajek's Basic Logic BL. This calculus has many of the desirable ...
The current first-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus whic...
Abstract. We present a sound and complete tableau calculus for the class of regular grammar logics. ...
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tablea...
Since 1993, when Hudelmaier developed an O(n log n)-space decision procedure for propositional Intui...
for the predicate calculus as to obtain a direct proof (without using compactness) of the fact that ...
We introduce a proof system for H´ ajek’s logic BL based on a relational hypersequents framework. W...
Abstract. In this paper we have a closer look at one of the rules of the tableau calculus presented ...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order ...
This paper presents a tableau based proof technique that is suitable for proving theorems in the two...
The logic of proofs (lp) was proposed as Gdels missed link between Intuitionistic and S4-proofs, but...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
International audienceWe analyze different features related to the mechanization of von Wright's log...