This paper illustrates for the propositional S4 a general scheme of transferring strategies of proof search in a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. 1 Introduction This paper presents a general scheme [10, 11] of transforming a cutfree Gentzentype system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov [7] for classical predicate logic. In this way completeness of strategies is first established for the Gentzen-type system, and then transferred to resolution. The method is illustrated here for the prop...
My purpose in this thesis is to show the merits of the approach of G. Gentzen to the accepted predic...
summary:We study relations between propositional Monotone Sequent Calculus (MLK --- also known as Ge...
The paper shows satisfiability in many propositional modal systems, including \textit{K}, \textit{KD...
. We discuss the general scheme of building resolution calculi (also called the inverse method) orig...
We extend Parigot's -calculus to form a system of realizers for classical logic which reflects ...
. We exploit a system of realizers for classical logic, and a translation from resolution into the s...
Extended version of a paper with the same title, which appeared in the Bulletin of Symbolic Logic i...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
Two related but independent topics are treated dealing with methods for mechanical theorem proving i...
Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. ...
Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. ...
We present a contraction-free sequent calculus GS4 for the modal logic S4 such that all the rules ar...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
We describe how the Davis-Putnam-Logemann-Loveland proced-ure DPLL is bisimilar to the goal-directed...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
My purpose in this thesis is to show the merits of the approach of G. Gentzen to the accepted predic...
summary:We study relations between propositional Monotone Sequent Calculus (MLK --- also known as Ge...
The paper shows satisfiability in many propositional modal systems, including \textit{K}, \textit{KD...
. We discuss the general scheme of building resolution calculi (also called the inverse method) orig...
We extend Parigot's -calculus to form a system of realizers for classical logic which reflects ...
. We exploit a system of realizers for classical logic, and a translation from resolution into the s...
Extended version of a paper with the same title, which appeared in the Bulletin of Symbolic Logic i...
this paper, we investigate lengths of proofs of propositional calculi, resolution and Gentzen type s...
Two related but independent topics are treated dealing with methods for mechanical theorem proving i...
Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. ...
Admissible rules of a logic are those rules under which the set of theorems of the logic is closed. ...
We present a contraction-free sequent calculus GS4 for the modal logic S4 such that all the rules ar...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
We describe how the Davis-Putnam-Logemann-Loveland proced-ure DPLL is bisimilar to the goal-directed...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDeducti...
My purpose in this thesis is to show the merits of the approach of G. Gentzen to the accepted predic...
summary:We study relations between propositional Monotone Sequent Calculus (MLK --- also known as Ge...
The paper shows satisfiability in many propositional modal systems, including \textit{K}, \textit{KD...