Strong Negation is Definable in 2Int
Hrafn Valt\'yr Oddsson
TL;DR
This paper demonstrates that strong negation can be explicitly defined within the framework of 2Int, a bi-intuitionistic logic system, expanding understanding of its expressive capabilities.
Contribution
It establishes that strong negation is definable in 2Int, revealing new expressive power of Wansing's bi-intuitionistic logic.
Findings
Strong negation is definable in 2Int
Expands understanding of 2Int's expressive power
Provides a new perspective on bi-intuitionistic logic
Abstract
I show that the strong negation is definable in 2Int, Wansing's bi-intuitionistic logic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge · Advanced Algebra and Logic