Positive logic is not elementary

We prove that the positive fragment of minimal first-order intuitionistic logic is not of elementary complexity. The proof uses an automata-theoretic approach taking advantage of the computational power of alternation.

Authors

• Aleksy Schubert
• Daria Walukiewicz-Chrząszcz
• Paweł Urzyczyn

Keywords

No keywords are indexed for this paper.