Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:apcz.umk.pl:article/14433

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

Authors
Publication date
6 July 2018
Publisher
Uniwersytet Mikołaja Kopernika w Toruniu

Abstract

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

Similar works

Full text

thumbnail-image

Akademicka Platforma Czasopism

redirect
oaioai:apcz.umk.pl:article/14433
Last time updated on 30/09/2023

This paper was published in Akademicka Platforma Czasopism.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.