Automata, Resolution, and Cut-elimination
Résumé
Automata, Resolution, and Cut-elimination are three methods to prove the decidability of provability in various logics. The goal of this paper is to understand the relation between these three methods, using Alternating pushdown systems as a unifying example. To this aim, we propose a new Resolution based saturation method for Polarized sequent calculus modulo theory and its associated cut-elimination theorem. We then show how it can be used to prove the decidability of Alternating pushdown systems.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|