Classical logic and the strict tolerant hierarchy
From MaRDI portal
(Redirected from Publication:1986084)
Recommendations
Cites work
Cited in
(33)- Higher-level paradoxes and substructural solutions
- Tolerant, classical, strict
- A family of strict/tolerant logics
- Transfinite meta-inferences
- On the metainferential solution to the semantic paradoxes
- Inferences and metainferences in \(\mathsf{ST}\)
- (I can't get no) antisatisfaction
- Inferential constants
- Anti-exceptionalism, truth and the BA-plan
- Multilateral supervaluationism and classicality
- The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework)
- A fully classical truth theory characterized by substructural means
- Meta-classical non-classical logics
- Metainferential duality
- Simple tableaus for simple logics
- Simple tableaus for simple intuitionistic logics
- Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates
- Metainferential reasoning on strong Kleene models
- A truth-maker semantics for ST: refusing to climb the strict/tolerant hierarchy
- (Meta)inferential levels of entailment beyond the Tarskian paradigm
- Tableaux for metainferential logics
- Derivability and metainferential validity
- Meta-arguments in heterogeneous logics and how to evaluate them
- Classical logic is not uniquely characterizable
- Editorial introduction: substructural logics and metainferences
- Empty logics
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
- One step is enough
- Inferential-connexive mixed logics
- \(\mathsf{ST}\) and \(\mathsf{TS}\) as product and sum
- Supervaluations and the strict-tolerant hierarchy
- Validities, antivalidities and contingencies: a multi-standard approach
- Metainferentially substructural validity theories
This page was built for publication: Classical logic and the strict tolerant hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986084)