Equational theory of ordinals with addition and left multiplication by $\omega$
Christian Choffrut

TL;DR
This paper establishes a finite axiomatization for the equational theory of a structure involving ordinals with addition and left multiplication by omega, providing a decision algorithm for term equality.
Contribution
It introduces a finite axiomatization and a linear-time decision algorithm for the equational theory of ordinals with addition and omega-multiplication.
Findings
Finite axiomatization of the theory
Linear-time decision algorithm for term equality
Simplified axiom schema for transfinite ordinals
Abstract
We show that the equational theory of the structure is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give an algorithm that given a pair of terms decides in linear time with respect of their common length whether or not is a consequence of the axioms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
