Logic in the Deep End

Analysis (forthcoming)
  Copy   BIBTEX

Abstract

Weak enough relevant logics are often closed under depth substitutions. To determine the breadth of logics with this feature, we show there is a largest sublogic of R closed under depth substitutions and that this logic can be recursively axiomatized.

Author Profiles

Shay Logan
Kansas State University
Graham Leach-Krouse
Kansas State University

Analytics

Added to PP
2023-11-21

Downloads
159 (#75,441)

6 months
159 (#18,126)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?