Nested Sequents for Provability Logic GLP
Logic
2024-11-14 v1 Logic in Computer Science
Abstract
We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically.
Keywords
Cite
@article{arxiv.1410.6652,
title = {Nested Sequents for Provability Logic GLP},
author = {Daniyar Shamkanov},
journal= {arXiv preprint arXiv:1410.6652},
year = {2024}
}