Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach

DOI10.1007/s10992-021-09639-zOpenAlexW3215699654MaRDI QIDQ2679583

Elio La Rosa, Pablo Cobreros, Luca Tranchini

Publication date: 23 January 2023

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-021-09639-z

zbMATH Keywords

paraconsistencythree-valued logicparacompletenesslabelled sequent calculusmeta-inferencehigher-level rules

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (2)

On the metainferential solution to the semantic paradoxes ⋮ Neutral free logic: motivation, proof theory and models

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logics of strict-tolerant logic
• Tolerant, classical, strict
• Transfinite meta-inferences
• Cut-free sequent calculi for some tense logics
• Classical logic and the strict tolerant hierarchy
• A hierarchy of classical and paraconsistent logics
• Derivability and metainferential validity
• Methoden zur Axiomatisierung beliebiger Aussagen- und Prädikatenkalküle
• ST, LP and Tolerant Metainferences
• The Method of Tree-Hypersequents for Modal Propositional Logic
• A natural extension of natural deduction
• Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
• A FULLY CLASSICAL TRUTH THEORY CHARACTERIZED BY SUBSTRUCTURAL MEANS
• Sequents in many valued logic I
• A family of metainferential logics

This page was built for publication: Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach