Strong Negation is Definable in 2Int
Logic
2025-01-27 v1
Authors:
Hrafn Valtýr Oddsson
Abstract
I show that the strong negation is definable in 2Int, Wansing's bi-intuitionistic logic.
Cite
@article{arxiv.2501.13979,
title = {Strong Negation is Definable in 2Int},
author = {Hrafn Valtýr Oddsson},
journal= {arXiv preprint arXiv:2501.13979},
year = {2025}
}
Comments
3 pages
Related papers
View all related →
Logic in Computer Science · Computer Science
A cut-free sequent calculus for the bi-intuitionistic logic 2Int
Sara Ayhan
2020-10-01
Logic · Mathematics
Two strong undefinability results in inquisitive and team semantics
Fausto Barbero
2024-07-31
Logic · Mathematics
Proofs of some Propositions of the semi-Intuitionistic Logic with Strong Negation
Juan Manuel Cornejo, Ignacio Viglizzo
2017-09-01
Logic in Computer Science · Computer Science
Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations
Sara Ayhan
2024-02-26
Logic · Mathematics
Strong negation in the theory of computable functionals TCF
Nils Köpp, Iosif Petrakis
2025-04-09
General Topology · Mathematics
Selection principles and countable dimension
Liljana Babinkostova, Marion Scheepers
2007-09-19
Logic in Computer Science · Computer Science
Bilateralism with incompatible proofs and refutations
Victor Barroso-Nascimento, Maria Osório, Elaine Pimentel
2026-05-05
Artificial Intelligence · Computer Science
A Functional View of Strong Negation in Answer Set Programming
Michael Bartholomew, Joohyung Lee
2013-12-24
Logic · Mathematics
Two-variable logic has weak, but not strong, Beth definability
H. Andréka, I. Németi
2021-02-03
Logic in Computer Science · Computer Science
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
Pascal Kettmann, Hannes Strass, Jesse Heyninck, Jeroen Spaans
2026-05-25
Logic in Computer Science · Computer Science
Revisiting Explicit Negation in Answer Set Programming
Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce +2
2020-02-19
Logic in Computer Science · Computer Science
Definability and Interpolation within Decidable Fixpoint Logics
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2023-06-22
Logic in Computer Science · Computer Science
Well-Founded Argumentation Semantics for Extended Logic Programming
Ralf Schweimeier, Michael Schroeder
2007-05-23
Logic · Mathematics
The Fan Theorem, its strong negation, and the determinacy of games
Wim Veldman
2023-11-14
Logic in Computer Science · Computer Science
A semantic account of strong normalization in Linear Logic
Daniel de Carvalho, Lorenzo Tortora de Falco
2014-08-28
Geometric Topology · Mathematics
Strongly invertible knots, invariant surfaces, and the Atiyah-Singer signature theorem
Antonio Alfieri, Keegan Boyle
2021-09-22
Logic · Mathematics
Implicitly definable generalized quantifiers
Fredrik Engström
2014-10-15
Artificial Intelligence · Computer Science
Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences
G. Brewka
2008-02-03
Combinatorics · Mathematics
A Multiple Integral Explicit Evaluation Inspired by the Multi-WZ Method
Akalu Tefera
2007-05-23
Logic in Computer Science · Computer Science
A Binary Quantifier for Definite Descriptions in Nelsonian Free Logic
Yaroslav Petrukhin
2025-01-03
Logic · Mathematics
Weak and Strong Versions of Effective Transfinite Recursion
Patrick Uftring
2025-02-11
High Energy Physics - Theory · Physics
Integrability and duality in two-dimensional QCD
E. Abdalla, M. C. B. Abdalla
2011-07-19
High Energy Physics - Theory · Physics
Seiberg-Witten theory and duality in integrable systems
A. Mironov
2007-05-23
Rings and Algebras · Mathematics
Weakly Strongly 2-Nil-Clean Rings
Peter Danchev, Mina Doostalizadeh, Ahmad Moussavi
2025-09-09
Logic in Computer Science · Computer Science
On Affine Logic and {\L}ukasiewicz Logic
Rob Arthan, Paulo Oliva
2014-08-18