Models of transfinite provability logic
Abstract
For any ordinal , we can define a polymodal logic GLP(), with a modality [] for each <. These represent provability predicates of increasing strength. Although GLP() has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities. Later, Icard defined a topological model for the same fragment which is very closely related to Ignatiev's. In this paper we show how to extend these constructions for arbitrary . More generally, for each , we build a Kripke model I(,) and a topological model T(,), and show that the closed fragment of GLP() is sound for both of these structures, as well as complete, provided is large enough.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.