A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics

DOI10.1002/MALQ.201400086zbMATH Open1388.03033OpenAlexW2358432189MaRDI QIDQ2813672FDOQ2813672

Authors: Norihiro Kamide 

Publication date: 24 June 2016

Published in: Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201400086

Recommendations

• Gentzenization and decidability of some contraction-less relevant logics
• scientific article; zbMATH DE number 4012564
• Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
• scientific article; zbMATH DE number 4142013
• Syntactical and semantical characterization of a class of paraconsistent logics
• A reasoning method for a paraconsistent logic
• A note on the decidability of a strong relevant logic
• scientific article; zbMATH DE number 859797
• Relevant logics: from semantics to proof systems
• On partial and paraconsistent logics

zbMATH Keywords

decidabilityparaconsistent logicrelevance logicconstructible negation

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Paraconsistent logics (03B53)

Cites Work

• Linear and affine logics with temporal, spatial and epistemic operators
• The undecidability of entailment and relevant implication
• Constructible falsity
• Logics of formal inconsistency
• Constructible falsity and inexact predicates
• Title not available (Why is that?)
• The Gentzenization and decidability of RW
• Combining linear-time temporal logic with constructiveness and paraconsistency
• Handbook of philosophical logic. Vol. 8
• Intuitionistic logic with strong negation
• A semantical study of constructible falsity
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
• Semantical analyses of propositional systems of Fitch and Nelson
• Logic Programming with Strong Negation and Inexact Predicates
• An embedding-based completeness proof for Nelson's paraconsistent logic

Cited In (4)

• Title not available (Why is that?)
• A note on the decidability of a strong relevant logic
• Paraconsistent fuzzy logic preserving non-falsity
• Paraconsistent constructive logic with strong negation as a contraction-free relevant logic

This page was built for publication: A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics

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