6 found
  1. Maximal paraconsistent extension of Johansson logic.S. P. Odintsov - 1998 - Logique Et Analyse 161:162-163.
    Export citation  
    Bookmark   6 citations  
  2. Representation of j-algebras and Segerberg's logics.S. P. Odintsov - 1999 - Logique Et Analyse 42 (166):81-106.
  3.  11
    Inconsistency-tolerant description logic. Part II: A tableau algorithm for CALC C.S. P. Odintsov & H. Wansing - 2008 - Journal of Applied Logic 6 (3):343-360.
  4.  23
    On the embedding of Nelson's logics.S. P. Odintsov - 2002 - Bulletin of the Section of Logic 31 (4):241-248.
  5.  18
    “Reductio ad absurdum” and Łukasiewicz's modalities.S. P. Odintsov - 2003 - Logic and Logical Philosophy 11:149-166.
    The present article contains part of results from my lecture delivered at II Flemish-Polish workshop on Ontological Foundation of Paraconsistency.
    Direct download (8 more)  
    Export citation  
    Bookmark   3 citations  
  6.  10
    On deductive bases for paraconsistent answer set semantics.N. V. Mayatskiy & S. P. Odintsov - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):131-146.
    It was proved by Odintsov and Pearce that the logic is a deductive base for paraconsistent answer set semantics of logic programs with two kinds of negation. Here we describe the lattice of logics extending, characterise these logics via classes of -models, and prove that none of the proper extensions of is a deductive base for PAS.
    Direct download (3 more)  
    Export citation