Blocking the Routes to Triviality with Depth Relevance

Journal of Logic, Language and Information 23 (4):493-526 (2014)
  Copy   BIBTEX

Abstract

In Rogerson and Restall’s, the “class of implication formulas known to trivialize ” is recorded. The aim of this paper is to show how to invalidate any member in this class by using “weak relevant model structures”. Weak relevant model structures verify deep relevant logics only.

Other Versions

No versions found

Links

PhilArchive



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

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
2019-05-31

Downloads
22 (#1,030,498)

6 months
3 (#1,096,948)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Gemma Robles
Universidad de León
José M. Méndez
Universidad de Salamanca

Citations of this work

Strong Depth Relevance.Shay Allen Logan - 2021 - Australasian Journal of Logic 18 (6):645-656.
What is a Relevant Connective?Shawn Standefer - 2022 - Journal of Philosophical Logic 51 (4):919-950.
Relevant first-order logic LP# and Curry’s paradox resolution.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal Volume 4, Issue 1-1, January 2015 DOI: 10.11648/J.Pamj.S.2015040101.12.

Add more citations

References found in this work

Relevant Logics and Their Rivals.Richard Routley, Val Plumwood, Robert K. Meyer & Ross T. Brady - 1982 - Ridgeview. Edited by Richard Sylvan & Ross Brady.
Universal Logic.Ross Brady - 2006 - CSLI Publications.
Universal Logic.Ross Brady - 2006 - Bulletin of Symbolic Logic 13 (4):544-547.
Transfinite Cardinals in Paraconsistent Set Theory.Zach Weber - 2012 - Review of Symbolic Logic 5 (2):269-293.
Entailment and relevance.Nuel D. Belnap - 1960 - Journal of Symbolic Logic 25 (2):144-146.

View all 17 references / Add more references