Switch to: Citations

Add references

You must login to add references.
  1. Natural Deduction for Three-Valued Regular Logics.Yaroslav Petrukhin - 2017 - Logic and Logical Philosophy 26 (2):197–206.
    In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s logic both with one (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Natural Deduction System in Paraconsistent Setting: Proof Search for PCont.Vasilyi Shangin & Alexander Bolotov - 2012 - Journal of Intelligent Systems 21 (1):1-24.
    . This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the `deductive explosion', i.e., where formulae of the type `A follows from false', for any A, are not valid. We formulate the natural deduction system for the logic PCont, explain its main concepts, define a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
  • A Calculus for Antinomies.F. G. Asenjo - 1966 - Notre Dame Journal of Formal Logic 16 (1):103-105.
  • Kleene's three valued logics and their children.Melvin Fitting - unknown
    Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bilattices. Finally we show that for bilinear bilattices the extensions do not produce any new equivalences.
     
    Export citation  
     
    Bookmark   47 citations