Switch to: References

Add citations

You must login to add citations.
  1. N-valued maximal paraconsistent matrices.Adam Trybus - 2019 - Journal of Applied Non-Classical Logics 29 (2):171-183.
    ABSTRACTThe articles Maximality and Refutability Skura [. Maximality and refutability. Notre Dame Journal of Formal Logic, 45, 65–72] and Three-valued Maximal Paraconsistent Logics Skura and Tuziak [. Three-valued maximal paraconsistent logics. In Logika. Wydawnictwo Uniwersytetu Wrocławskiego] introduced a simple method of proving maximality of a given paraconsistent matrix. This method stemmed from the so-called refutation calculus, where the focus in on rejecting rather than accepting formulas. The article A Generalisation of a Refutation-related Method in Paraconsistent Logics Trybus [. A generalisation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • A Generalisation of a Refutation-related Method in Paraconsistent Logics.Adam Trybus - forthcoming - Logic and Logical Philosophy.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Vidal's trivalent explanations for defective conditional in mathematics.Yaroslav Petrukhin & Vasily Shangin - 2019 - Journal of Applied Non-Classical Logics 29 (1):64-77.
    ABSTRACTThe paper deals with a problem posed by Mathieu Vidal to provide a formal representation for defective conditional in mathematics Vidal, M. [. The defective conditional in mathematics. Journal of Applied Non-Classical Logics, 24, 169–179]. The key feature of defective conditional is that its truth-value is indeterminate if its antecedent is false. In particular, we are interested in two explanations given by Vidal with the use of trivalent logics. By analysing a simple argument from plane geometry, where defective conditional is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generalized Correspondence Analysis for Three-Valued Logics.Yaroslav Petrukhin - 2018 - Logica Universalis 12 (3-4):423-460.
    Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the paracomplete (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations