Non-transitive counterparts of every Tarskian logic

Analysis 84 (2):320-326 (2024)
  Copy   BIBTEX

Abstract

The aim of this article is to show that, just as in recent years Cobreros, Egré, Ripley and van Rooij have provided a non-transitive counterpart of classical logic (i.e. one in which all classically acceptable inferences are valid but Cut and other metainferences are not), the same can be done for every Tarskian logic, with full generality. To establish this fact, a semantic approach is taken by showing that appropriate structures can be devised to characterize a non-transitive counterpart of every Tarskian logic, starting from the logical matrices that are usually taken to render them.

Author's Profile

Damian Szmuc
Universidad de Buenos Aires (UBA)

Analytics

Added to PP
2023-06-27

Downloads
304 (#54,621)

6 months
138 (#25,358)

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?