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

DOI10.1007/S10992-021-09639-ZMaRDI QIDQ2679583zbMATH OpenOpenAlexFDO

Authors Pablo Cobreros, Elio La Rosa, Luca Tranchini

Publication date 23 January 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

paraconsistencyparacompletenessthree-valued logiclabelled sequent calculusmeta-inferencehigher-level rules

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• On all strong Kleene generalizations of classical logic
• Metainferential reasoning on strong Kleene models
• Sequent-calculi for metainferential logics
• Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates
• Deep \textsf{ST}

Cites work

• scientific article; zbMATH DE number 6699700 (Why is no real title available?)
• scientific article; zbMATH DE number 4033738 (Why is no real title available?)
• scientific article; zbMATH DE number 559756 (Why is no real title available?)
• scientific article; zbMATH DE number 949290 (Why is no real title available?)
• A family of metainferential logics
• A fully classical truth theory characterized by substructural means
• A hierarchy of classical and paraconsistent logics
• A natural extension of natural deduction
• Automated deduction for many-valued logics
• Classical logic and the strict tolerant hierarchy
• Cut-free sequent calculi for some tense logics
• Deep sequent systems for modal logic
• Derivability and metainferential validity
• Methoden zur Axiomatisierung beliebiger Aussagen- und Prädikatenkalküle
• Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
• ST, LP and tolerant metainferences
• Sequents in many valued logic I
• The Method of Tree-Hypersequents for Modal Propositional Logic
• The logics of strict-tolerant logic
• Tolerant, classical, strict
• Transfinite meta-inferences

Cited in

(4)

• On the metainferential solution to the semantic paradoxes
• Metainferential reasoning on strong Kleene models
• A hybrid calculus for the validities and invalidities of classical propositional logic
• Neutral free logic: motivation, proof theory and models

Describes a project that uses

Uses Software

• Pesca

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679583)