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

&
Logic and Logical Philosophy:1 (forthcoming)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.12775/llp.2018.009

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

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.
Natural Deduction for Three-Valued Regular Logics.Yaroslav Petrukhin - 2017 - Logic and Logical Philosophy 26 (2):197–206.
Kleene's three valued logics and their children.Melvin Fitting - unknown
Completeness via correspondence for extensions of the logic of paradox.Barteld Kooi & Allard Tamminga - 2012 - Review of Symbolic Logic 5 (4):720-730.
The contribution of A.V. Kuznetsov to the theory of modal systems and structures.Alexei Y. Muravitsky - 2008 - Logic and Logical Philosophy 17 (1-2):41-58.
Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
Off-Topic: A New Interpretation of Weak-Kleene Logic.Jc Beall - 2016 - Australasian Journal of Logic 13 (6).
Combined reasoning by automated cooperation.Christoph Benzmüller, Volker Sorge, Mateja Jamnik & Manfred Kerber - 2008 - Journal of Applied Logic 6 (3):318-342.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
A Completenesss Theorem for a 3-Valued Semantics for a First-order Language.Christopher Gauker - manuscript
Truth, Partial Logic and Infinitary Proof Systems.Martin Fischer & Norbert Gratzl - 2017 - Studia Logica 106 (3):1-26.
On All Strong Kleene Generalizations of Classical Logic.Stefan Wintein - 2016 - Studia Logica 104 (3):503-545.
A splitting logic in NExt(KTB).Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381 - 394.
A Splitting Logic in NExt.Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381-394.

Analytics

Added to PP
2018-07-11

Downloads
19 (#794,398)

6 months
6 (#508,040)

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.
Zum intuitionistischen aussagenkalkül.K. Gödel - 1932 - Anzeiger der Akademie der Wissenschaften in Wien 69:65--66.

View all 25 references / Add more references