Embedding Friendly First-Order Paradefinite and Connexive Logics

Journal of Philosophical Logic 51 (5):1055-1102 (2022)
  Copy   BIBTEX

Abstract

First-order intuitionistic and classical Nelson–Wansing and Arieli–Avron–Zamansky logics, which are regarded as paradefinite and connexive logics, are investigated based on Gentzen-style sequent calculi. The cut-elimination and completeness theorems for these logics are proved uniformly via theorems for embedding these logics into first-order intuitionistic and classical logics. The modified Craig interpolation theorems for these logics are also proved via the same embedding theorems. Furthermore, a theorem for embedding first-order classical Arieli–Avron–Zamansky logic into first-order intuitionistic Arieli–Avron–Zamansky logic is proved using a modified Gödel–Gentzen negative translation. The failure of a theorem for embedding first-order classical Nelson–Wansing logic into first-order intuitionistic Nelson–Wansing logic is also shown.

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2022-04-26

Downloads
22 (#960,280)

6 months
6 (#827,406)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The collected papers of Gerhard Gentzen.Gerhard Gentzen - 1969 - Amsterdam,: North-Holland Pub. Co.. Edited by M. E. Szabo.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
Constructible falsity.David Nelson - 1949 - Journal of Symbolic Logic 14 (1):16-26.
Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.

View all 28 references / Add more references