This paper contains a proof–theoretic account of unification in intermediate logics. It is shown that many existing results can be extended to fragments that at least contain implication and conjunction. For such fragments, the connection between valuations and most general unifiers is clarified, and it is shown how from the closure of a formula under the Visser rules a proof of the formula under a projective unifier can be obtained. This implies that in the logics considered, for the n-unification type to be finitary it suffices that the m-th Visser rule is admissible for a sufficiently large m. At the end of the paper it is shown how these results imply several well-known results from the literature
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe unification problem in a propositional logic is to determine, given a form...
In this thesis, we investigate the admissible rules of intermediate logics. On the one hand, one can...
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...
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 (fragments of) transitive reflexive ...
Following a characterization [10] of locally tabular logics with finitary (or unitary) unification b...
National audienceIn this talk, we will give a survey of the results on unification in modal logic an...
In this paper we study the admissible rules of intermediate logics with the disjunction property. We...
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of it...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe unification problem in a propositional logic is to determine, given a form...
In this thesis, we investigate the admissible rules of intermediate logics. On the one hand, one can...
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...
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 (fragments of) transitive reflexive ...
Following a characterization [10] of locally tabular logics with finitary (or unitary) unification b...
National audienceIn this talk, we will give a survey of the results on unification in modal logic an...
In this paper we study the admissible rules of intermediate logics with the disjunction property. We...
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of it...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. un...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe unification problem in a propositional logic is to determine, given a form...
In this thesis, we investigate the admissible rules of intermediate logics. On the one hand, one can...