6533b854fe1ef96bd12af639
RESEARCH PRODUCT
Projective unification in transitive modal logics
Sławomir Kostsubject
Transitive relationPure mathematicsUnificationunificationLogic010102 general mathematics02 engineering and technology01 natural sciencescanonical modelModal0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingprajective unifier0101 mathematicsProjective testMathematicsmodal logicdescription
We show that a transitive normal modal logic L enjoys projective unification (i.e. each unifiable formula is projective) if and only if L contains K4D1 ( D1 : ( x → y ) ∨ ( y → x ) ). It means, in particular, that K4D1 (and any of its extensions) is almost structurally complete, i.e. the logic is complete with respect to all non-passive admissible rules. We also characterize non-unifiable formulas and provide an explicit form of the basis for all passive rules over K4G + ( x → x )
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2018-06-18 | Logic Journal of the IGPL |