Borja Sierra Miranda

dblp:359/1932 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0002-0079-8473ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2026 Knowledge and Common Knowledge of Strategies
Borja Sierra Miranda, Thomas Studer
WoLLIC1
2025 Non-wellfounded Proof Theory for Interpretability Logic
abstract
Abstract We provide a simple cut elimination proof for the interpretability logic of $$\textsf{IL}$$ IL . To achieve this, we introduce a traditional Gentzen-style sequent calculus for $$\textsf{IL}$$ IL and a non-wellfounded version of it. The non-wellfounded calculus makes it possible to avoid diagonal formulas. Hence, we can give a simple argument based on a general proof-theoretic method for calculi of this kind. Our results provide a useful basis for further research; in particular, they will allow us to establish uniform interpolation for $$\textsf{IL}$$ IL .
Sebastijan Horvat, Borja Sierra Miranda, Thomas Studer
TABLEAUX2
2024 Coalgebraic Proof Translations for Non-Wellfounded Proofs
Borja Sierra Miranda, Thomas Studer, Lukas Zenger
AiML1