Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.08768

Free Left Distributive Algebras and a Canonical Extension

Scott Cramer·Meng-Che "Turbo" Ho·Sheila K. Miller Edwards·Nam Trang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Assuming a large cardinal hypothesis, Laver gave a representation of the monogenerated free left distributive algebra (LDA) using elementary embeddings and used this representation to prove many algebraic results. Some of these results were later proved by Dehornoy in ZFC, without the large cardinal hypotheses. However, there is an important algebraic result whose consistency strength is unknown. (See Laver (1995) and Dougherty & Jech (1997).) Recent results [arXiv:2508.02244] extend the connection between elementary embeddings of set theory and free LDAs to the many-generated case. Assuming large cardinals, we prove two results. First, we prove that finitely-generated free LDAs with distinct numbers of generators are $Σ_1$-elementarily equivalent but not $Σ_2$-elementarily equivalent. We also prove a partial structural analogue to Laver's representation of LDAs. We construct an extension of the monogenerated free LDA where application by any fixed element is an elementary embedding of LDAs. We argue that this extension is canonical by demonstrating homogeneity and universality properties. These results also provide additional examples of algebraic properties provable from large cardinals without known proofs from the standard axioms of set theory.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Scott Cramer, Meng-Che "Turbo" Ho, Sheila K. Miller Edwards, Nam Trang. 2026-04-09. Free Left Distributive Algebras and a Canonical Extension. https://arxiv.org/abs/2604.08768

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↗