The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra

2025/07/16 by Michael Pinsker, Pinsker, Michael, Jakub Rydval +5
Computer Science · Decision Sciences · Mathematics · #03C99 (Primary) 05C99 (Secondary) #Advanced Algebra and Logic #Combinatorics (math.CO) #FOS: Mathematics #Fuzzy and Soft Set Theory #Logic (math.LO) #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2507.12078

openalex publication_date 2025/07/16 · openalex created_date 2025/10/14 · openalex updated_date 2026/07/28

Abstract

We prove that the random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra, hereby answering an open question of Bartošová and Scow.

Citations

• A new perspective on semi-retractions and the Ramsey property
• Pre-adjunctions and the Ramsey property

Related

• Random graphs in the monadic theory of order
• Reducts of the random partial order
• Random Graph: Stronger logic but with the zero one law
• Some simple theories from a Boolean algebra point of view
• An example of a new simple theory