Every finite incompatibility scenario embeds into a Boolean algebra and is classically realizable by a game; every exclusivity graph is the atom graph of an exclusive pBA that embeds into a Boolean algebra.
Title resolution pending
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Classically Realizable Incompatibility
Every finite incompatibility scenario embeds into a Boolean algebra and is classically realizable by a game; every exclusivity graph is the atom graph of an exclusive pBA that embeds into a Boolean algebra.