Implicational relevance logic is 2-exptime-complete

Journal of Symbolic Logic 81 (2):641-661 (2016)
  Copy   BIBTEX

Abstract

We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

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

Through your library

Similar books and articles

Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.
Implicational Logic, Relevance, and Refutability.Tomasz Skura - 2020 - Logic and Logical Philosophy 29 (1):19-33.
Completeness of implicational relevant logics.R. Kashima - 2000 - Logic Journal of the IGPL 8 (6):761-785.
The Systems of Relevance Logic.Ryszard Mirek - 2011 - Argument: Biannual Philosophical Journal 1 (1):87-102.
Implicational Partial Gaggle Logics and Matrix Semantics.Eunsuk Yang - 2023 - Korean Journal of Logic 26 (2):131-144.
The implicational fragment of dummet's LC.R. A. Bull - 1962 - Journal of Symbolic Logic 27 (2):189-194.

Analytics

Added to PP
2016-06-30

Downloads
20 (#1,084,435)

6 months
1 (#1,572,794)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Relevance Logic: Problems Open and Closed.Alasdair Urquhart - 2016 - Australasian Journal of Logic 13 (1):11-20.

Add more citations

References found in this work

Entailment: The Logic of Relevance and Necessity.[author unknown] - 1975 - Studia Logica 54 (2):261-266.
Relevance Logic.Michael Dunn & Greg Restall - 1983 - In Dov M. Gabbay & Franz Guenthner, Handbook of Philosophical Logic. Dordrecht, Netherland: Kluwer Academic Publishers.

Add more references