Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.20229

Completeness and Incompleteness for Expanding Gödel-Löb Logics

Somayeh Chopoghloo·David Fernández-Duque·Joost J. Joosten·Sofía Santiago-Fernández
View original source ↗Read source document ↗Export metadata ↓

Abstract

Expanding products of modal logics are bimodal logics obtained from the combination of a `horizontal component' logic and a `vertical component' logic, lying between the fusion and the Cartesian product of the two logics. Gabelaia et al. showed that expanding products are often decidable when the first component is Noetherian, although their methods are semantical and do not yield complete axiomatisations. They do, however, propose a candidate, dubbed the expanding commutator of the two logics and known to be complete in many `non-Noetherian' cases. In this paper, we consider various expanding products of modal logics whose vertical component is $\sf GL$. We show that the standard axiomatisation is complete when the horizontal component is either $ {\sf K4}$ or $ {\sf GL} $, but incomplete when it is ${\sf Grz}$ or any logic between ${\sf K4.3}$ and ${\sf Grz.3}$, thus yielding a partial solution to a question posed by Gabelaia et al. more than two decades ago.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Somayeh Chopoghloo, David Fernández-Duque, Joost J. Joosten, Sofía Santiago-Fernández. 2026-06-18. Completeness and Incompleteness for Expanding Gödel-Löb Logics. https://arxiv.org/abs/2606.20229

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↗