Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.27252

On the Definability of Strong Negation in Bilateral Logics

Ryan Simonelli
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recent work in bilateral logic has concerned itself with whether and to what extent strong negation, which "toggles" between assertion and denial, is definable in bilateral systems that lack it. This paper presents a number of results about the definability of strong negation in bilateral systems. First, I show that a constructive Nelson-style Sheffer stroke defines the strong negation of A as (A|(A|A))|A. The same stroke defines the constructive Nelson implication, thus providing a single-connective basis for the strong-negation-and-implication fragment of N4. Second, I provide an exhaustive characterization of the eight combinations of a single "aggregative" connective and a single Nelson-style connective that suffice to jointly define strong negation, with neither defining it individually. One such combination is the material conditional together with constructive co-implication. Third, I show that a constructive and connexive Wansing-style Sheffer stroke (recently referred to as "connexive exclusion") likewise defines the strong negation of A as (A|(A| A))|A and also defines connexive implication. Fourth, I show that, unlike with the Nelson-style connectives, there are no combinations of Wansing-style and aggregative connectives that jointly define strong negation if neither connective defines it individually.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ryan Simonelli. 2026-07-28. On the Definability of Strong Negation in Bilateral Logics. https://arxiv.org/abs/2607.27252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗