On the provable contradictions of the connexive logics \(\mathbf{C}\) and \(\mathbf{C3}\)

DOI10.1007/s10992-023-09709-4OpenAlexW4385381637MaRDI QIDQ6054061

Satoru Niki, Heinrich Wansing

Publication date: 24 October 2023

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

Full work available at URL: https://doi.org/10.1007/s10992-023-09709-4

zbMATH Keywords

strong implicationconnexive logicnon-trivial contradictory logicsprovable contradictions

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Constructive logic with strong negation is a substructural logic. I
• Constructive logic with strong negation is a substructural logic. II
• Aristotle's thesis in consistent and inconsistent logics
• Second-order logic of paradox
• Reasoning with logical bilattices
• Constructible falsity and inexact predicates
• Bilattices and the semantics of logic programming
• Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
• Logic and groups
• SEMANTICS FOR PURE THEORIES OF CONNEXIVE IMPLICATION
• Sequent and hypersequent calculi for abelian and łukasiewicz logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the provable contradictions of the connexive logics \(\mathbf{C}\) and \(\mathbf{C3}\)