Contact posets
Logic
2023-06-28 v2
Abstract
We study contact posets and show that every contact poset can be embedded into a Boolean poset with overlap contact relation. Contact posets and (nonadditive) contact semilattices have the superamalgamation property, Fra\"\i ss\'e limits and model completion. Some results apply to event structures with binary conflict, as introduced in computer science.
Cite
@article{arxiv.2303.06259,
title = {Contact posets},
author = {Paolo Lipparini},
journal= {arXiv preprint arXiv:2303.06259},
year = {2023}
}
Comments
v2, some additions