Abstract
We introduce a general notion of semantic structure for first-order theories, covering a variety of constructions such as Tarski and Kripke semantics, and prove that, over Zermelo–Fraenkel set theory (ZF), the completeness of such semantics is equivalent to the Boolean prime ideal theorem (BPI). Using a result of McCarty (2008), we conclude that the completeness of Kripke semantics is equivalent, over intuitionistic Zermelo–Fraenkel set theory (IZF), to the Law of Excluded Middle plus BPI. Along the way, we also prove the equivalence, over ZF, between BPI and the completeness theorem for Kripke semantics for both first-order and propositional theories.
Citation
Christian Espíndola. "Semantic Completeness of First-Order Theories in Constructive Reverse Mathematics." Notre Dame J. Formal Logic 57 (2) 281 - 286, 2016. https://doi.org/10.1215/00294527-3470433
Information