Papers › Lattice-ordered groups generated by an ordered group and regular systems of ideals
Lattice-ordered groups generated by an ordered group and regular systems of ideals
Thierry Coquand, Henri Lombardi, Stefan Neuwirth
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Unbounded entailment relations, introduced by Paul Lorenzen (1951), are a slight variant of a notion which plays a fundamental r\^ole in logic (see Scott 1974) and in algebra (see Lombardi and Quitt\'e 2015). We call systems of ideals their single-conclusion counterpart. If they preserve the order of a commutative ordered monoid G and are equivariant w.r.t. its law, we call them equivariant systems of ideals for G: they describe all morphisms from G to meet-semilattice-ordered monoids generated by (the image of) G. Taking an article by Lorenzen (1953) as a starting point, we also describe all morphisms from a commutative ordered group G to lattice-ordered groups generated by G through unbounded entailment relations that preserve its order, are equivariant, and satisfy a regularity property invented by Lorenzen (1950); we call them regular entailment relations. In particular, the free lattice-ordered group generated by G is described through the finest regular entailment relation for G, and we provide an explicit description for it; it is order-reflecting if and only if the morphism is injective, so that the Lorenzen-Clifford-Dieudonn\'e theorem fits into our framework. Lorenzen's research in algebra starts as an inquiry into the system of Dedekind ideals for the divisibility group of an integral domain R, and specifically into Wolfgang Krull's "Fundamentalsatz" that R may be represented as an intersection of valuation rings if and only if R is integrally closed: his constructive substitute for this representation is the regularisation of the system of Dedekind ideals, i.e. the lattice-ordered group generated by it when one proceeds as if its elements are comparable.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections