Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Logic and Logical Philosophy

Authors help

  1. 1 Petrukhin Y.

  2. 1 Shangin V.

Years help

  1. 1 2019

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  strong Kleene logic
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis

100%
Petrukhin Y., Shangin V.
Logic and Logical Philosophy
|
2019
|
vol. 28
|
issue 2
223–257
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.