Year: 2026
Type: article
Abstract: Non-wellfounded proof theory has been applied to establish uniform interpolation and Lyndon interpolation (separately) for multiple logics.However, it has not yet been used to prove uniform Lyndon interpolation.We close this gap by showing uniform Lyndon interpolation for the provability logic GLS.This logic was known to have uniform interpolation, but it was open whether it has uniform Lyndon interpolation (or at least non-uniform Lyndon interpolation).The methodology we provide is easy to adapt to other provability logics if a non-wellfounded sequent calculus is available for them.In addition, we offer an alternative proof of cut elimination for GLS via non-wellfounded proofs.
DOI: 10.4204/eptcs.447.40
Authors: Borja Sierra Miranda, Thomas Studer
Institution: University of Bern
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7166458240
FWCI:
Cites:
Cited by:
Related to: