2021
DOI: 10.1007/s10992-021-09610-y
|View full text |Cite
|
Sign up to set email alerts
|

Validities, antivalidities and contingencies: A multi-standard approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 25 publications
0
1
0
Order By: Relevance
“…Hence, a meta n inference is antivalid just in case it is never satisfied by a valuation. 12 In [4], some of us suggested that we can understand the antivalidities of a logic as the meta n inferences that the logic rejects:…”
Section: Meta-classical Non-classical Logicsmentioning
confidence: 99%
See 2 more Smart Citations
“…Hence, a meta n inference is antivalid just in case it is never satisfied by a valuation. 12 In [4], some of us suggested that we can understand the antivalidities of a logic as the meta n inferences that the logic rejects:…”
Section: Meta-classical Non-classical Logicsmentioning
confidence: 99%
“…There is a sense in which the study of metainferences can be traced back to Gentzen's [39] pioneer works on sequent calculi. 4 However, the more recent interest in metainferences emerged within studies in truth, vagueness, and other paradoxical phenomena. First, they were used as a technical tool to characterize logics ST and TS (see below) as well as the theories based upon them [e.g.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…And once we have this-at this point admittedly still vagueidea, we can ask: Is there a logic that agrees with classical logic up to level 1, or 2, or 3, ... or perhaps even some arbitrarily high level n? Over the last couple of years, Barrio, Pailos, and Szmuc have shown that the (astonishing) answer is: Yes, there are such logics for any finite n, and we can even push this to the first limit ordinal ω and agree with classical logic at all finite levels, while still having a transparent truth-predicate (Barrio et al, 2019a;Pailos, 2020;Barrio and Pailos, 2022). 4 To see how this hierarchy of logics is constructed, we must define what meta-inferences of arbitrary levels are and how we can define logics governing such objects.…”
Section: The Strict/tolerant Hierarchymentioning
confidence: 99%