ST, LP and tolerant metainferences

DOI10.1007/978-3-030-25365-3_18zbMATH Open1469.03074OpenAlexW2998600196MaRDI QIDQ3305673FDOQ3305673

Authors: Bogdan Dicher, Francesco Paoli 

Publication date: 10 August 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-25365-3_18

Recommendations

• Inferences and metainferences in \(\mathsf{ST}\)
• The logics of strict-tolerant logic
• A model of tolerance
• A family of strict/tolerant logics
• A fully classical truth theory characterized by substructural means

Mathematics Subject Classification ID

Paraconsistent logics (03B53)

Cites Work

• The logic of paradox
• The logics of strict-tolerant logic
• Tolerant, classical, strict
• Title not available (Why is that?)
• Naive modus ponens and failure of transitivity
• Naive \textit{modus ponens}
• Multiple conclusions
• Proof theory for fuzzy logics
• What is the logic of inference?
• Equivalence of consequence operations
• Simple consequence relations
• Abstract algebraic logic. An introductory textbook
• Doubt truth to be a liar
• Proof-theoretic semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gentzen's cut-free calculus versus the logic of paradox
• Anything goes

Cited In (33)

• The logics of strict-tolerant logic
• A family of metainferential logics
• A family of strict/tolerant logics
• 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
• The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework)
• Sequent-calculi for metainferential logics
• A recovery operator for nontransitive approaches
• A fully classical truth theory characterized by substructural means
• Metainferential duality
• A hierarchy of classical and paraconsistent logics
• Knot is not that nasty (but it is hardier than tonk)
• Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates
• Metainferential reasoning on strong Kleene models
• Editorial introduction
• Sequent calculi for first-order ST
• Deep \textsf{ST}
• Derivability and metainferential validity
• On three-valued presentations of classical logic
• Is Cantor's theorem a dialetheia? Variations on a paraconsistent approach to Cantor's theorem
• 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
• Metasequents and tetravaluations
• Requiem for logical nihilism, or: logical nihilism annihilated
• \(\mathsf{ST}\) and \(\mathsf{TS}\) as product and sum
• A hybrid calculus for the validities and invalidities of classical propositional logic
• The laws of thought and the laws of truth as two sides of one coin
• Validities, antivalidities and contingencies: a multi-standard approach

This page was built for publication: ST, LP and tolerant metainferences

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