Proof systems combining classical and paraconsistent negations
type: Item
instance of: scholarly article
title: Proof systems combining classical and paraconsistent negations
zbMATH Open document ID: 1171.03012
author: Norihiro Kamide
published in: Studia Logica
publication date: 2009-05-08T00:00:00Z
Mathematics Subject Classification ID: 03B53
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 5552250
zbMATH Keywords: paraconsistent negation
zbMATH Keywords: sequent calculus
zbMATH Keywords: cut elimination
zbMATH Keywords: completeness
MaRDI profile type: Publication
full work available at URL: s11225-009-9173-6
OpenAlex ID: W1984851236
cites work: Constructible falsity and inexact predicates
cites work: Q4085699
cites work: Reasoning with logical bilattices
cites work: Q3858244
cites work: Intuitive semantics for first-degree entailments and `coupled trees'
cites work: Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
cites work: Q4678356
cites work: Gentzen-type methods for bilattice negation
cites work: Q3435250
cites work: The Trilattice of Constructive Truth Values
cites work: Some useful 16-valued logics: How a computer network should think
cites work: Hyper-contradictions, generalized truth values and logics of truth and falsehood
cites work: Proof theory
cites work: The logic of information structures
DOI: 10.1007/S11225-009-9173-6
description: scientific article; zbMATH DE number 5552250