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

Links

PhilArchive



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

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.
Subprevarieties Versus Extensions. Application to the Logic of Paradox.Alexej P. Pynko - 2000 - Journal of Symbolic Logic 65 (2):756-766.
A Splitting Logic in NExt.Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381-394.
A splitting logic in NExt(KTB).Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381 - 394.
A Logical Account of Formal Argumentation.Yining Wu, Martin Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):383-403.
Correspondence analysis for strong three-valued logic.Allard Tamminga - 2014 - Logical Investigations 20:255-268.
A Propositional Logic with Relative Identity Connective and a Partial Solution to the Paradox of Analysis.Xuefeng Wen - 2007 - Studia Logica 85 (2):251-260.
Logic of Simpson paradox.Jacek Malinowski - 2005 - Logic and Logical Philosophy 14 (2):203-210.
A binary Routley semantics for intuitionistic De Morgan minimal logic HM and its extensions.G. Robles & J. M. Mendez - 2015 - Logic Journal of the IGPL 23 (2):174-193.
Characterizing Quantifier Extensions of Dependence Logic.Fredrik Engström & Juha Kontinen - 2013 - Journal of Symbolic Logic 78 (1):307-316.
Truth Be Told: Sense, Quantity, and Extension.John Justice - 2015 - New York: Peter Lang.
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA.Willem Conradie, Valentin Goranko & Dimitar Vakarelov - 2010 - Journal of Applied Logic 8 (4):319-333.
Facing Up to the Sorites Paradox.Terry Horgan - 2000 - The Proceedings of the Twentieth World Congress of Philosophy 6:99-111.
Correia Semantics Revisited.Thomas Macaulay Ferguson - 2016 - Studia Logica 104 (1):145-173.
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.

Analytics

Added to PP
2018-01-18

Downloads
30 (#532,397)

6 months
7 (#428,584)

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.
Natural Deduction: A Proof-Theoretical Study.Richmond Thomason - 1965 - Journal of Symbolic Logic 32 (2):255-256.
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.

View all 28 references / Add more references