Add to ORKGStudia Logica L,2, 299-319, 1991This paper treats decision problems for the intuitionistic logic without weakening rule $ FL_ec $. First, the cut elimination theorem for $ FL_ec $ will be shown. Using this fact and Kripke\u27s method, it will be proved that the propositional $ FL_ec $, is decidable. On the other hand, the predicate $ FL_ec $, will be shown to be undecidable by reducing the decision problem to that of the intuitionistic predicate logic
AbstractIn this paper we introduce effectiveness into model theory of intuitionistic logic. The main...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
In this report, a decision procedure for intuitionistic propositional logic is presented which is an...
Abstract. This paper treats decision problexs for the intuitionistic logic without weak-ening rule F...
Non-classical logics have been studied to realize some logics we use in our everyday lives, and have...
AbstractIn this paper we give a new proof of cut elimination in Gentzen's sequent system for intuiti...
In this paper we show that the usual intuitionistic characterization of the decidability of the prop...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
Abstract. We establish foundational results on the computational com-plexity of deciding entailment ...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
This paper presents a constructive proof of completeness of Kripke models for the intuitionistic pr...
The paper of J. Ketonen and R. Weyhrauch [6] defines a decidable fragment of first-order predicate l...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
We improve the answer to the question: what set of excluded middles forpropositional variables in a ...
AbstractIn this paper we introduce effectiveness into model theory of intuitionistic logic. The main...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
In this report, a decision procedure for intuitionistic propositional logic is presented which is an...
Abstract. This paper treats decision problexs for the intuitionistic logic without weak-ening rule F...
Non-classical logics have been studied to realize some logics we use in our everyday lives, and have...
AbstractIn this paper we give a new proof of cut elimination in Gentzen's sequent system for intuiti...
In this paper we show that the usual intuitionistic characterization of the decidability of the prop...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
Abstract. We establish foundational results on the computational com-plexity of deciding entailment ...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
This paper presents a constructive proof of completeness of Kripke models for the intuitionistic pr...
The paper of J. Ketonen and R. Weyhrauch [6] defines a decidable fragment of first-order predicate l...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
We improve the answer to the question: what set of excluded middles forpropositional variables in a ...
AbstractIn this paper we introduce effectiveness into model theory of intuitionistic logic. The main...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
In this report, a decision procedure for intuitionistic propositional logic is presented which is an...