Strong negation is definable in 2Int

DOI10.1093/LOGCOM/EXAG035MaRDI QIDQ7322997zbMATH OpenFDO

Authors Hrafn Valtýr Oddsson

Publication date 1 September 2026

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAG035

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A Generalized Notion of Refutation for Gentzen Calculi*
• A more general general proof theory
• A natural deduction system for first degree entailment
• A remark on Gentzen's calculus of sequents
• Bi-intuitionistic logics: a new instance of an old problem
• Constructible falsity
• Constructible falsity and inexact predicates
• Dual intuitionistic logic and a variety of negations: the logic of scientific research
• Dual-intuitionistic logic
• Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle
• Falsification, natural deduction and bi-intuitionistic logic
• scientific article; zbMATH DE number 1612555 (Why is no real title available?)
• scientific article; zbMATH DE number 3689368 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3412605 (Why is no real title available?)
• Introduction: Bilateralism and Proof-Theoretic Semantics (Part I)
• Meaning and identity of proofs in a bilateralist setting: a two-sorted typed lambda-calculus for proofs and refutations
• Natural deduction for dual-intuitionistic logic
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
• The class of extensions of Nelson's paraconsistent logic
• Wansing's bi-intuitionistic logic: semantics, extension and unilateralisation

This page was built for publication: Strong negation is definable in 2Int

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