Switch to: References

Add citations

You must login to add citations.
  1. A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics.Natalya Tomova - 2021 - Bulletin of the Section of Logic 50 (1):35-53.
    In this paper, we consider the class of four-valued literal-paraconsistent-paracomplete logics constructed by combination of isomorphs of classical logic CPC. These logics form a 10-element upper semi-lattice with respect to the functional embeddinig one logic into another. The mechanism of variation of paraconsistency and paracompleteness properties in logics is demonstrated on the example of two four-element lattices included in the upper semi-lattice. Functional properties and sets of tautologies of corresponding literal-paraconsistent-paracomplete matrices are investigated. Among the considered matrices there are the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Automated correspondence analysis for the binary extensions of the logic of paradox.Yaroslav Petrukhin & Vasily Shangin - 2017 - Review of Symbolic Logic 10 (4):756-781.
    B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Bochvar's Three-Valued Logic and Literal Paralogics: Their Lattice and Functional Equivalence.Alexander Karpenko & Natalya Tomova - 2017 - Logic and Logical Philosophy 26 (2):207-235.
    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 ‘strong’ isomorphs leads to the construction of two famous paralogics (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations