This paper contains a proof-theoretic account of unification in (fragments of) transitive reflexive modal logics, which means that the reasoning is syntactic and uses as little semantics as possible. New proofs of theorems on unification types are given and these results are extended to fragments. It is shown that transitive reflexive fragments that contain at least implication and conjunction have finitary unification, and that in the absence of disjunction they have unitary unification. The relation between classical valuations and projective unifiers is clarified, and it is shown that also in fragments the Visser rules form a basis for the admissible rules once they are admissible
Unification was originally introduced in automated deduction and term rewriting, but has recently al...
We show that the unification problem `is there a substitution instance of a given formula that is pr...
ABSTRACT: Modal formulas can be proved by translating them into a three-typed logic and then using u...
This paper contains a proof-theoretic account of unification in (fragments of) transitive reflexive ...
National audienceIn this talk, we will give a survey of the results on unification in modal logic an...
This paper contains a proof theoretic treatment of some aspects of unifica-tion in intermediate logi...
This paper contains a proof–theoretic account of unification in intermediate logics. It is shown tha...
This paper contains a proof theoretic treatment of some aspects of unification in intermediate logic...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
We 1 study unification of formulas in modal logics and consider logics which are equivolent w.r.t. u...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceUnification in propositional logics is an active research area. In this paper,...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
Unification was originally introduced in automated deduction and term rewriting, but has recently al...
We show that the unification problem `is there a substitution instance of a given formula that is pr...
ABSTRACT: Modal formulas can be proved by translating them into a three-typed logic and then using u...
This paper contains a proof-theoretic account of unification in (fragments of) transitive reflexive ...
National audienceIn this talk, we will give a survey of the results on unification in modal logic an...
This paper contains a proof theoretic treatment of some aspects of unifica-tion in intermediate logi...
This paper contains a proof–theoretic account of unification in intermediate logics. It is shown tha...
This paper contains a proof theoretic treatment of some aspects of unification in intermediate logic...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
We 1 study unification of formulas in modal logics and consider logics which are equivolent w.r.t. u...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceUnification in propositional logics is an active research area. In this paper,...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
Unification was originally introduced in automated deduction and term rewriting, but has recently al...
We show that the unification problem `is there a substitution instance of a given formula that is pr...
ABSTRACT: Modal formulas can be proved by translating them into a three-typed logic and then using u...