CUT ELIMINATION FOR A NON-WELLFOUNDED SYSTEM FOR THE MASTER MODALITY
The Journal of Symbolic Logic · 16.06.2026 · 1-24
DOI: 10.1017/jsl.2026.10225 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 16.06.2026. Verfasst von BORJA SIERRA MIRANDA und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In [10], we provided a method for eliminating cuts in non-wellfounded proofs with a local-progress condition, these being the simplest kind of non-wellfounded proofs. The method consisted of splitting the proof into nicely behaved fragments. This article extends our method to proofs based on simple trace conditions. The main idea is to split the system with the trace condition into infinitely many local-progress calculi that together are equivalent to the original trace-based system. This provides a cut-elimination method using only basic tools of structural proof theory and corecursion, which is needed due to working in a non-wellfounded setting. We will employ our method to obtain syntactic cut elimination for K+, a system of modal logic with the master modality.
Zitieren
APA
MIRANDA, B. S., & STUDER, T. (2026). CUT ELIMINATION FOR A NON-WELLFOUNDED SYSTEM FOR THE MASTER MODALITY. The Journal of Symbolic Logic, 1-24. https://doi.org/10.1017/jsl.2026.10225
Vancouver
MIRANDA BS, STUDER T. CUT ELIMINATION FOR A NON-WELLFOUNDED SYSTEM FOR THE MASTER MODALITY. The Journal of Symbolic Logic. 2026:1-24. doi:10.1017/jsl.2026.10225
BibTeX
@article{MIRANDA2026,
author = {MIRANDA, BORJA SIERRA and STUDER, THOMAS},
title = {CUT ELIMINATION FOR A NON-WELLFOUNDED SYSTEM FOR THE MASTER MODALITY},
journal = {The Journal of Symbolic Logic},
year = {2026},
pages = {1--24},
doi = {10.1017/jsl.2026.10225}
}
EUVIMED