Abstract

Kapsner strong logics, originally studied in the context of connexive logics, are those in which all formulas of the form Arightarrow lnot A or lnot Arightarrow A are unsatisfiable, and in any model at most one of Arightarrow B, Arightarrow lnot B is satisfied. In this paper, such logics are studied algebraically by means of algebraic structures in which negation is modeled by an operator lnot s.t. any element a is incomparable with lnot a. A range of properties which are (in)compatible with such operators are studied, and examples are given; finally, the question of which further operators can be added to such structures is broached.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call