Iterating reflection over intuitionistic arithmetic
Abstract
In this note, we investigate iterations of consistency, local and uniform reflection over HA (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem to HA, drawing on Rathjen's proof of Feferman's classical result.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.