Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2306.07806

Logic and computation as combinatorics

Norihiro Yamada
View original source ↗Read source document ↗Export metadata ↓

Abstract

The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness and the atomicity of syntax are preferable for foundational aims as seen in Hilbert's program. Another issue is that a uniform basis for logic and computation has been missing, and this problem hampers a coherent view on them. For instance, formal proofs in proof theory are far from (ordinary) proofs of the validity of a formula in model theory. Our goal is to solve these fundamental problems by rebuilding central concepts in logic and computation such as formal systems, validity (in such a way that it coincides with the existence of proofs), cut-elimination and computability uniformly in terms of finite graphs based on game semantics. Unlike game semantics, however, we do not rely on anything infinite or extrinsic to the graphs. A key idea that enables our finitary, autonomous approach is the shift from graphs in game semantics to dynamic ones. The resulting combinatorics establishes a single, syntax-free, finitary framework that recasts formal systems admitting proofs with cuts, validity, the finest computational steps of cut-elimination and higher-order computability. This subsumes fully complete semantics of intuitionistic linear logic, which solves a problem open for thirty years, and even extends the full completeness to proofs with cuts. As a byproduct, our dynamic graphs give rise to Hopf algebras, which opens up new applications of algebras to logic and computation.

Explore related subjects

math.LOcs.LOmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Norihiro Yamada. 2023-06-13. Logic and computation as combinatorics. https://arxiv.org/abs/2306.07806

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↗