Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
Logic and Logical Philosophy · 06.07.2018 · 28 (2)
DOI: 10.12775/llp.2018.009 ↗Kurz gefasst
Fachartikel in der Zeitschrift Logic and Logical Philosophy, online erschienen am 06.07.2018. Verfasst von Yaroslav Petrukhin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Petrukhin, Y., & Shangin, V. (2018). Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis. Logic and Logical Philosophy, 28(2). https://doi.org/10.12775/llp.2018.009
Vancouver
Petrukhin Y, Shangin V. Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis. Logic and Logical Philosophy. 2018;28(2). doi:10.12775/llp.2018.009
BibTeX
@article{Petrukhin2018,
author = {Petrukhin, Yaroslav and Shangin, Vasilyi},
title = {Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis},
journal = {Logic and Logical Philosophy},
year = {2018},
volume = {28},
number = {2},
doi = {10.12775/llp.2018.009}
}
EUVIMED