Papers
Topics
Authors
Recent
Search
2000 character limit reached

(Non-)well-founded derivations in the provability logic $\mathsf{GLP}$

Published 2 Apr 2025 in math.LO | (2504.01388v1)

Abstract: We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{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 $\mathsf{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 $\mathsf{GLP}$ (with ordinary derivations only).

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.