A hierarchy of weak double negations

DOI10.1007/s11225-013-9533-0zbMath1329.03064OpenAlexW1966601466MaRDI QIDQ2016059

Norihiro Kamide

Publication date: 19 June 2014

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-013-9533-0

zbMATH Keywords

completenessparaconsistent negationcut-eliminationdouble negation axiomweak double negation axiom

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Paraconsistent logics (03B53)

Related Items (5)

Taming Paraconsistent (and Other) Logics ⋮ Modal multilattice logic ⋮ Paraconsistent double negations as classical and intuitionistic negations ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits for paraconsistent calculi
• A non-deterministic view on non-classical negations
• Some useful 16-valued logics: How a computer network should think
• Hyper-contradictions, generalized truth values and logics of truth and falsehood
• Proof systems combining classical and paraconsistent negations
• Intuitionistic logic with strong negation
• The value of the four values
• The logic of information structures
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Possible-translations semantics for some weak classically-based paraconsistent logics
• Constructible falsity and inexact predicates
• Constructible falsity

This page was built for publication: A hierarchy of weak double negations