2000 character limit reached
A first-order completeness result about characteristic Boolean algebras in classical realizability (2209.08838v1)
Published 19 Sep 2022 in cs.LO and math.LO
Abstract: We prove the following completeness result about classical realizability: given any Boolean algebra with at least two elements, there exists a Krivine-style classical realizability model whose characteristic Boolean algebra is elementarily equivalent to it. This is done by controlling precisely which combinations of so-called "angelic" (or "may") and "demonic" (or "must") nondeterminism exist in the underlying model of computation.