Admissibility of Ackermann's rule δ in relevant logics

Logic and Logical Philosophy 22 (4):411-427 (2013)
  Copy   BIBTEX

Abstract

It is proved that Ackermann’s rule δ is admissible in a wide spectrum of relevant logics satisfying certain syntactical properties

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Some Metacomplete Relevant Modal Logics.Takahiro Seki - 2013 - Studia Logica 101 (5):1115-1141.
Where gamma fails.Robert K. Meyer, Steve Giambrone & Ross T. Brady - 1984 - Studia Logica 43 (3):247 - 256.
Paraconsistent logics included in Lewis’ S4.Gemma Robles & José M. Méndez - 2010 - Review of Symbolic Logic 3 (3):442-466.
Relational proof system for relevant logics.Ewa Orlowska - 1992 - Journal of Symbolic Logic 57 (4):1425-1440.
Metacompleteness of Substructural Logics.Takahiro Seki - 2012 - Studia Logica 100 (6):1175-1199.

Analytics

Added to PP
2013-10-29

Downloads
30 (#517,657)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gemma Robles
Universidad de León

Citations of this work

Trees for E.Shawn Standefer - 2018 - Logic Journal of the IGPL 26 (3):300-315.
Basic Quasi-Boolean Expansions of Relevance Logics.Gemma Robles & José M. Méndez - 2021 - Journal of Philosophical Logic 50 (4):727-754.

Add more citations

References found in this work

What is strict implication?Ian Hacking - 1963 - Journal of Symbolic Logic 28 (1):51-71.
Begründung Einer Strengen Implikation.Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):327-328.
What is Strict Implication?Ian Hacking - 1972 - Journal of Symbolic Logic 37 (2):417-417.

View all 7 references / Add more references