Automated correspondence analysis for the binary extensions of the logic of paradox

&
Review of Symbolic Logic 10 (4):756-781 (2017)
  Copy   BIBTEX

Abstract

B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.

Categories

Keywords

Reprint years

DOI

10.1017/s1755020317000156

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

Completeness via correspondence for extensions of the logic of paradox.Barteld Kooi & Allard Tamminga - 2012 - Review of Symbolic Logic 5 (4):720-730.
Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis.Yaroslav Petrukhin & Vasilyi Shangin - forthcoming - Logic and Logical Philosophy:1.
Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.
Generalized Correspondence Analysis for Three-Valued Logics.Yaroslav Petrukhin - 2018 - Logica Universalis 12 (3-4):423-460.
Correspondence analysis for strong three-valued logic.Allard Tamminga - 2014 - Logical Investigations 20:255-268.
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.
Solovay-Type Theorems for Circular Definitions.Shawn Standefer - 2015 - Review of Symbolic Logic 8 (3):467-487.
Subprevarieties Versus Extensions. Application to the Logic of Paradox.Alexej P. Pynko - 2000 - Journal of Symbolic Logic 65 (2):756-766.
A simple sequent system for minimally inconsisteny LP.Rea Golan - 2023 - Review of Symbolic Logic 16 (4):1296-1311.

Analytics

Added to PP
2018-01-18

Downloads
40 (#559,342)

6 months
7 (#699,353)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Vasily Olegovich Shangin
Moscow State University
Yaroslav Petrukhin
Moscow State University

Citations of this work

Exactly true and non-falsity logics meeting infectious ones.Alex Belikov & Yaroslav Petrukhin - 2020 - Journal of Applied Non-Classical Logics 30 (2):93-122.

View all 6 citations / Add more citations

References found in this work

The logic of paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
Entailment: The Logic of Relevance and Necessity.[author unknown] - 1975 - Studia Logica 54 (2):261-266.
On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
Introduction to Logic.Irving M. Copi - 1954 - Revue de Métaphysique et de Morale 59 (3):344-345.
A Calculus for Antinomies.F. G. Asenjo - 1966 - Notre Dame Journal of Formal Logic 16 (1):103-105.

View all 27 references / Add more references