G3-style Sequent Calculi for Gurevich Logic and Its Neighbors

Studia Logica:1-29 (forthcoming)
  Copy   BIBTEX

Abstract

G3-style sequent calculi are introduced for a family of logics with strong negation: Gurevich logic, Nelson logic, intuitionistic propositional logic, Avron logic, De-Omori logic, and classical propositional logic. Structural properties including cut elimination are established for these calculi. In addition, a Glivenko theorem for embedding classical propositional logic into Gurevich logic is shown.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

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
2024-09-27

Downloads
12 (#1,461,278)

6 months
10 (#383,177)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle, Contemporary aspects of philosophy. Boston: Oriel Press.
Constructible falsity.David Nelson - 1949 - Journal of Symbolic Logic 14 (1):16-26.
Constructible falsity and inexact predicates.Ahmad Almukdad & David Nelson - 1984 - Journal of Symbolic Logic 49 (1):231-233.
Intuitionistic logic with strong negation.Yuri Gurevich - 1977 - Studia Logica 36 (1-2):49 - 59.

View all 10 references / Add more references