Skip to main content
×
Home
    • Aa
    • Aa

AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX

  • YAROSLAV PETRUKHIN (a1) and VASILY SHANGIN (a1)
Abstract
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.

Copyright
Corresponding author
* FACULTY OF PHILOSOPHY DEPARTMENT OF LOGIC LOMONOSOV MOSCOW STATE UNIVERSITY LOMONOSOVSKY PROSPEKT, 27-4, GSP-1 MOSCOW 119991, RUSSIA E-mail: yaroslav.petrukhin@mail.ru
FACULTY OF PHILOSOPHY DEPARTMENT OF LOGIC LOMONOSOV MOSCOW STATE UNIVERSITY LOMONOSOVSKY PROSPEKT, 27-4, GSP-1 MOSCOW 119991, RUSSIA E-mail: shangin@philos.msu.ru
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

F. G Asenjo . (1966). A calculus of antinomies. Notre Dame Journal of Formal Logic, 7(1), 103105.

F. G Asenjo . & J Tamburino . (1975). Logic of antinomies. Notre Dame Journal of Formal Logic, 16(1), 1744.

A Avron . (1991). Natural 3-valued logics—Characterization and proof theory. The Journal of Symbolic Logic, 56(1), 276294.

A Avron . (1986). On an implicational connective of RM. Notre Dame Journal of Formal Logic, 27(2), 201209.

A. Bolotov , A. Basukoski , O. Grigoriev , & V Shangin . (2006). Natural deduction calculus for linear-time temporal logic. Lecture Notes in Computer Science, 4160, 5668.

A. Bolotov & V Shangin . (2012). Natural deduction system in paraconsistent setting: Proof search for PCont. Journal of Intelligent Systems, 21(1), 124.

R. L Epstein . (1990). The Semantic Foundations of Logic. Vol. 1: Propositional Logic. Dordrecht: Kluwer.

S. C Kleene . (1938). On a notation for ordinal numbers. The Journal of Symbolic Logic, 3(4), 150155.

B. Kooi & A Tamminga . (2012). Completeness via correspondence for extensions of the logic of paradox. The Review of Symbolic Logic, 5(4), 720730.

J. N Martin . (1975). A syntactic characterization of Kleene’s strong connectives with two designated values. Mathematical Logic Quarterly, 21(1), 181184.

V. M Popov . (1999). On the logics related to Arruda’s system V1. Logic and Logical Philosophy, 7, 8790.

G Priest . (1979). The logic of paradox. Journal of Philosophical Logic, 8(1), 219241.

G Priest . (1984). Logic of paradox revisited. Journal of Philosophical Logic, 13(2), 153179.

H Sahlqvist . (1975). Completeness and correspondence in the first and second order semantics for modal logic. In S. Kanger , editor. Proceeding of the Third Scandinavian Logic Symposium. Amsterdam: North-Holland Publishing Company, pp. 110143.

W. Sieg & F Pfenning . (guest editors) (1998). Note by the guest editors. Studia Logia, 60(1), 1.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 87 *
Loading metrics...

* Views captured on Cambridge Core between 3rd July 2017 - 24th July 2017. This data will be updated every 24 hours.