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

&
Logic and Logical Philosophy 28 (2):223-257 (2019)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.12775/llp.2018.009

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,248

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Automated correspondence analysis for the binary extensions of the logic of paradox.Yaroslav Petrukhin & Vasily Shangin - 2017 - Review of Symbolic Logic 10 (4):756-781.
Correspondence analysis for strong three-valued logic.Allard Tamminga - 2014 - Logical Investigations 20:255-268.
Generalized Correspondence Analysis for Three-Valued Logics.Yaroslav Petrukhin - 2018 - Logica Universalis 12 (3-4):423-460.
Completeness via correspondence for extensions of the logic of paradox.Barteld Kooi & Allard Tamminga - 2012 - Review of Symbolic Logic 5 (4):720-730.
Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.
Normalisation for Some Quite Interesting Many-Valued Logics.Nils Kürbis & Yaroslav Petrukhin - 2021 - Logic and Logical Philosophy 30 (3):493-534.
Natural Deduction for Three-Valued Regular Logics.Yaroslav Petrukhin - 2017 - Logic and Logical Philosophy 26 (2):197–206.
A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic.Gemma Robles & José M. Méndez - 2022 - Logic Journal of the IGPL 30 (1):21-33.
The Method of Socratic Proofs Meets Correspondence Analysis.Dorota Leszczyńska-Jasion, Yaroslav Petrukhin & Vasilyi Shangin - 2019 - Bulletin of the Section of Logic 48 (2):99-116.
Correspondence Analysis for Some Fragments of Classical Propositional Logic.Yaroslav Petrukhin & Vasilyi Shangin - 2021 - Logica Universalis 15 (1):67-85.

Analytics

Added to PP
2018-07-11

Downloads
40 (#656,684)

6 months
12 (#354,571)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Petrukhin
Moscow State University

Citations of this work

Add more citations

References found in this work

The logic of paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
Paraconsistent logic.Graham Priest - 2008 - Stanford Encyclopedia of Philosophy.
On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
Natural 3-valued logics—characterization and proof theory.Arnon Avron - 1991 - Journal of Symbolic Logic 56 (1):276-294.
Paraconsistent extensional propositional logics.Diderik Batens - 1980 - Logique and Analyse 90 (90):195-234.

View all 25 references / Add more references