Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.02244

A free two-generated left distributive algebra of elementary embeddings

Andrew D. Brooke-Taylor·Scott Cramer·Sheila K. Miller Edwards
View original source ↗Read source document ↗Export metadata ↓

Abstract

The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding under the operation of application is in fact the free left distributive (LD) algebra on one generator. This and associated theorems using the set-theoretic structure of the embeddings yielded numerous results about general LD algebras under the assumption of I3, only some of which have since been proven without the use of such a strong axiom. A natural question is whether, under the assumption of I3, one can obtain a free LD algebra of embeddings on more than one generator. Here we show that, under an assumption only just above I3 in the large cardinal hierarchy (namely, I2), we indeed obtain a two-generated free left distributive algebra of rank-to-rank embeddings.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Andrew D. Brooke-Taylor, Scott Cramer, Sheila K. Miller Edwards. 2025-08-04. A free two-generated left distributive algebra of elementary embeddings. https://arxiv.org/abs/2508.02244

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗