2016
DOI: 10.12775/llp.2016.029
|View full text |Cite
|
Sign up to set email alerts
|

Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence

Abstract: Abstract. In the present paper, various features of the class of propositional literal paralogics are considered. Literal paralogics are logics in which the paraproperties such as paraconsistence, paracompleteness and paranormality, occur only at the level of literals; that is, formulas that are propositional letters or their iterated negations. We begin by analyzing Bochvar's three-valued nonsense logic B3, which includes two isomorphs of the propositional classical logic CPC. The combination of these two 'st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
18
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 21 publications
(19 citation statements)
references
References 27 publications
0
18
0
1
Order By: Relevance
“…In the case of the only designated value 1, this class contains implications → i , 1 i 8. Note that → 7 is an implication of Karpenko and Tomova's literal paralogic TK 2 [22] (TK 1 's implication is → 4 ). Moreover, → 8 is Sette's implication [45].…”
Section: Implicational Extensions Of Kmentioning
confidence: 99%
“…In the case of the only designated value 1, this class contains implications → i , 1 i 8. Note that → 7 is an implication of Karpenko and Tomova's literal paralogic TK 2 [22] (TK 1 's implication is → 4 ). Moreover, → 8 is Sette's implication [45].…”
Section: Implicational Extensions Of Kmentioning
confidence: 99%
“…The class of LPP logics is well studied. Among the LPP logics considered in this paper, there are the logics described in [19], [18], [21], [16], [7], [12], [5], [15].…”
Section: Introductionmentioning
confidence: 99%
“…There are several algorithms of constructing classes of such logics, for example, we can note the following ones: (1) construction of LPP logics by combination of isomorphs of classical logic CP C [11]; (2) construction of LPP logics by using literal-paraconsistent-paracomplete matrices (or LPPmatrices) [13]. But the classes of LPP logics constructed by these two methods are not equal: the class obtained by (1) is a subclass of the class obtained by (2).…”
Section: Introductionmentioning
confidence: 99%
“…The difference between employing (iii) and (iv) for modelling the DM case is discussed in[1]; the formalisms based on such orderings -in[11,12].…”
mentioning
confidence: 99%