SearcharxivSearch

arXiv · 2604.08768

Free Left Distributive Algebras and a Canonical Extension

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 $\Sigma_1$-elementarily equivalent but not $\Sigma_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

Keep this discovery

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO