2020
DOI: 10.1093/jigpal/jzaa024
|View full text |Cite
|
Sign up to set email alerts
|

Extensions of paraconsistent weak Kleene logic

Abstract: Paraconsistent weak Kleene ($\textrm{PWK}$) logic is the $3$-valued logic based on the weak Kleene matrices and with two designated values. In this paper, we investigate the poset of prevarieties of generalized involutive bisemilattices, focussing in particular on the order ideal generated by Α$\textrm{lg} (\textrm{PWK})$. Applying to this poset a general result by Alexej Pynko, we prove that, exactly like Priest’s logic of paradox, $\textrm{PWK}$ has only one proper nontrivial extension apart from classical l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 28 publications
1
11
0
Order By: Relevance
“…A structure of this sort is an algebra counting with two partial orders (in our case, where x, y ∈ {t, o, e, f }, the orders ≤ ∧ and ≤ ∨ respectively defined by letting x ≤ ∧ y if and only if x ∧ y = x, and x ≤ ∨ y if and only if x ∨ y = y), with an involution (in our case, the operation ¬), with no constants for the infimum and the supremum elements. Interestingly enough, these authors show that every generalized involutive bisemilattice is decomposable as a P lonka sum over a semilattice direct system of Boolean algebras [32,Theorem 4]. Whence, our comments below oriented at representing FP in this way provide an exemplification of their general result.…”
Section: Further Remarks On the Semanticsmentioning
confidence: 89%
See 3 more Smart Citations
“…A structure of this sort is an algebra counting with two partial orders (in our case, where x, y ∈ {t, o, e, f }, the orders ≤ ∧ and ≤ ∨ respectively defined by letting x ≤ ∧ y if and only if x ∧ y = x, and x ≤ ∨ y if and only if x ∨ y = y), with an involution (in our case, the operation ¬), with no constants for the infimum and the supremum elements. Interestingly enough, these authors show that every generalized involutive bisemilattice is decomposable as a P lonka sum over a semilattice direct system of Boolean algebras [32,Theorem 4]. Whence, our comments below oriented at representing FP in this way provide an exemplification of their general result.…”
Section: Further Remarks On the Semanticsmentioning
confidence: 89%
“…Before moving on, it may as well be noted that FP is a special kind of algebra. It is what F. Paoli and M. Pra Baldi call in [32] a generalized involutive bisemilattice. A structure of this sort is an algebra counting with two partial orders (in our case, where x, y ∈ {t, o, e, f }, the orders ≤ ∧ and ≤ ∨ respectively defined by letting x ≤ ∧ y if and only if x ∧ y = x, and x ≤ ∨ y if and only if x ∨ y = y), with an involution (in our case, the operation ¬), with no constants for the infimum and the supremum elements.…”
Section: Further Remarks On the Semanticsmentioning
confidence: 92%
See 2 more Smart Citations
“…For example, the algebraic structure underlying the two-valued semantics for Classical Logic is a Boolean algebra, as we said before-that is to say, a complemented bounded distributive lattice. In this respect, it is interesting to highlight that the weak Kleene algebra is a (generalized) involutive bisemilattice-see [24] and references therein.…”
Section: Infectious Logicsmentioning
confidence: 99%