Abstract
In this paper, we investigate the logical strength of completeness theorems for intuitionistic logic along the program of reverse mathematics. Among others we show that $\sf {ACA}_0$ is equivalent over $\sf {RCA}_0$ to the strong completeness theorem for intuitionistic logic: any countable theory of intuitionistic predicate logic can be characterized by a single Kripke model.
Citation
Takeshi Yamazaki. "Reverse Mathematics and Completeness Theorems for Intuitionistic Logic." Notre Dame J. Formal Logic 42 (3) 143 - 148, 2001. https://doi.org/10.1305/ndjfl/1063372197
Information
