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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
