Description

• Title:
  Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
• Creator:
  Petrukhin, Yaroslav;
  Shangin, Vasilyi
• Description:
  Using the method of correspondence analysis, Tamminga obtains sound and complete natural deduction systems for all the unary and binary truth-functional extensions of Kleene’s strong three-valued logic K3 . In this paper, we extend Tamminga’s result by presenting an original finite, sound and complete proof-searching technique for all the truth-functional binary extensions of K3.
• Object availability:
  free access
• Rights:
  Prawa autorskie (c) 2018 Logic and Logical Philosophy
• Date:
  2018.07.06
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Language:
  English
• Source:
  Logic and Logical Philosophy; Vol. 28 No. 2 (2019): June; 223–257;
  Logic and Logical Philosophy; Tom 28 Nr 2 (2019): czerwiec; 223–257;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Publisher:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relation: https://apcz.umk.pl/LLP/article/view/LLP.2018.009/15150
• Subject:
  proof search;
  correspondence analysis;
  three-valued logic;
  strong Kleene logic;
  natural deduction;
  proof theory
• Identifier: https://apcz.umk.pl/LLP/article/view/LLP.2018.009
• Data provider:
  Akademicka Platforma Czasopism
• Can I use it?:
  seek permission
• Type:
  text