A hierarchy of classical and paraconsistent logics
DOI10.1007/S10992-019-09513-ZzbMATH Open1471.03053OpenAlexW2938145278WikidataQ128091091 ScholiaQ128091091MaRDI QIDQ2301322FDOQ2301322
Authors: Federico Matias Pailos, Damian Szmuc, Eduardo Alejandro Barrio 
Publication date: 24 February 2020
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-019-09513-z
Recommendations
- scientific article; zbMATH DE number 2196613
- scientific article; zbMATH DE number 761283
- scientific article; zbMATH DE number 4212001
- (Meta)inferential levels of entailment beyond the Tarskian paradigm
- Non-Fregean logics of analytic equivalence. I
- From iff to is: some new thoughts on identity in relevant logics
- Logics of relative identity
- First-order belief and paraconsistency
- OPERANDS AND INSTANCES
- Relativizations of the Principle of Identity
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Paraconsistent logics (03B53) Abstract deductive systems (03B22)
Cites Work
- The logics of strict-tolerant logic
- Conservatively extending classical logic with transparent truth
- What is a paraconsistent logic?
- ST, LP and tolerant metainferences
- Tolerant, classical, strict
- A fully classical truth theory characterized by substructural means
- A recovery operator for nontransitive approaches
- Priest's motorbike and tolerant identity
- Tolerance and mixed consequence in the S'valuationist setting
- Naive \textit{modus ponens}
- On all strong Kleene generalizations of classical logic
- Equivalence of consequence operations
- What logical pluralism cannot be
- Title not available (Why is that?)
- Valuational semantics of rule derivability
- A hierarchy of classical and paraconsistent logics
- A family of metainferential logics
- Characterizing logical consequence in many-valued logic
- Gentzen's cut-free calculus versus the logic of paradox
- Noncontractive classical logic
- The original sin of proof-theoretic semantics
Cited In (36)
- A family of strict/tolerant logics
- Transfinite meta-inferences
- Title not available (Why is that?)
- 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
- Metainferential duality
- A hierarchy of classical and paraconsistent logics
- Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates
- Metainferential reasoning on strong Kleene models
- Editorial introduction
- A cartography of LFIs and truth
- (Meta)inferential levels of entailment beyond the Tarskian paradigm
- The strict/tolerant idea and bilattices
- Classical logic and the strict tolerant hierarchy
- Deep \textsf{ST}
- Derivability and metainferential validity
- The final cut
- Axioms for classical, intuitionistic, and paraconsistent hybrid logic
- 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
- Requiem for logical nihilism, or: logical nihilism annihilated
- \(\mathsf{ST}\) and \(\mathsf{TS}\) as product and sum
- Substructural logics, pluralism and collapse
- Title not available (Why is that?)
- The logic of sortals. A conceptualist approach
- Supervaluations and the strict-tolerant hierarchy
- Validities, antivalidities and contingencies: a multi-standard approach
- Sub-classical Boolean Bunched Logics and the Meaning of Par
This page was built for publication: A hierarchy of classical and paraconsistent logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301322)
