Reverse mathematics and completeness theorems for intuitionistic logic

Research output: Contribution to journalArticlepeer-review

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 ACA0 is equivalent over RCA0 to the strong completeness theorem for intuitionistic logic: any countable theory of intuitionistic predicate logic can be characterized by a single Kripke model.

Original languageEnglish
Pages (from-to)143-148
Number of pages6
JournalNotre Dame Journal of Formal Logic
Volume42
Issue number3
DOIs
Publication statusPublished - 2001

Keywords

  • Completeness theorems
  • In-tuitionistic logic
  • Reverse mathematics
  • Second-order arithmetic

ASJC Scopus subject areas

  • Logic

Fingerprint Dive into the research topics of 'Reverse mathematics and completeness theorems for intuitionistic logic'. Together they form a unique fingerprint.

Cite this