A first-order completeness result about characteristic Boolean algebras in classical realizability
Logic in Computer Science
2022-09-20 v1 Logic
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.
Keywords
Cite
@article{arxiv.2209.08838,
title = {A first-order completeness result about characteristic Boolean algebras in classical realizability},
author = {Guillaume Geoffroy},
journal= {arXiv preprint arXiv:2209.08838},
year = {2022}
}