Following a characterization [10] of locally tabular logics with finitary (or unitary) unification by their Kripke models we determine the unification types of some intermediate logics (extensions of {\sf INT}). There are exactly four maximal logics with nullary unification ${\mathsf L}(\mathfrak R_{2}+)$, ${\mathsf L}(\mathfrak R_{2})\cap{\mathsf L}(\mathfrak F_{2})$, ${\mathsf L}(\mathfrak G_{3})$ and ${\mathsf L}(\mathfrak G_{3}+)$ and they are tabular. There are only two minimal logics with hereditary finitary unification: ${\mathsf L}$($\mathbf F_{un}$), the least logic with hereditary unitary unification, and ${\mathsf L}$( $\mathbf F_{pr}$) the least logic with hereditary projective approximation; they are locally tabular. Unitary an...
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of it...
In this thesis, we shall investigate the unification problem in ordinary modal logics, fusions of tw...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceThe unification problem in a propositional logic is to determine, given a form...
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...
UNIF 2020, part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Univ...
This paper contains a proof theoretic treatment of some aspects of unifica-tion in intermediate logi...
In this paper we study the admissible rules of intermediate logics with the disjunction property. We...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe unification problem in a normal modal logic is to determine, given a formu...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
We prove that the unification type of Lukasiewicz logic with a finite number of variables is either ...
International audienceIt is already known that unifiable formulas in normal modal logic K + Box Box ...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of it...
In this thesis, we shall investigate the unification problem in ordinary modal logics, fusions of tw...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...
International audienceThe unification problem in a propositional logic is to determine, given a form...
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...
UNIF 2020, part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Univ...
This paper contains a proof theoretic treatment of some aspects of unifica-tion in intermediate logi...
In this paper we study the admissible rules of intermediate logics with the disjunction property. We...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
International audienceThe unification problem in a normal modal logic is to determine, given a formu...
Unification, or solving equations on finite trees, is a P-complete problem central to symbolic manip...
We prove that the unification type of Lukasiewicz logic with a finite number of variables is either ...
International audienceIt is already known that unifiable formulas in normal modal logic K + Box Box ...
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rul...
Introduction : We prove that all extensions of K45 have projective unification and K5 and some of it...
In this thesis, we shall investigate the unification problem in ordinary modal logics, fusions of tw...
International audienceThe problem of unification in a normal modal logic L can be defined as follows...