(Non-)well-founded derivations in the provability logic GLP

Abstract

We examine cyclic, non-well-founded and well-founded derivations in the provability logic GLP. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the same proper infinitary extension of GLP. We establish that this extension is strongly algebraic and neighbourhood complete with respect to both local and global semantic consequence relations. In fact, these completeness results are proved for generalizations of global and local consequence relations, which we call global-local. In addition, we prove strong local neighbourhood completeness for the original system GLP (with ordinary derivations only).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…