  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.
