Automata, Resolution, and Cut-elimination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

Automata, Resolution, and Cut-elimination


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.
Fichier principal
Vignette du fichier
automata.pdf (328.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04063102 , version 1 (13-04-2023)
hal-04063102 , version 2 (13-04-2023)


  • HAL Id : hal-04063102 , version 2


Guillaume Burel, Gilles Dowek, Ying Jiang. Automata, Resolution, and Cut-elimination. 2016. ⟨hal-04063102v2⟩
14 View
6 Download


Gmail Facebook Twitter LinkedIn More