The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915393122074624 |
|---|---|
| author | Pinsker, Michael Rydval, Jakub Schöbi, Moritz Spiess, Christoph |
| author_facet | Pinsker, Michael Rydval, Jakub Schöbi, Moritz Spiess, Christoph |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12078 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra Pinsker, Michael Rydval, Jakub Schöbi, Moritz Spiess, Christoph Logic Combinatorics 03C99 (Primary) 05C99 (Secondary) 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. |
| title | The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra |
| topic | Logic Combinatorics 03C99 (Primary) 05C99 (Secondary) |
| url | https://arxiv.org/abs/2507.12078 |