Preprints, Working Papers, ... Year : 2015

Cut-elimination and the decidability of reachability in alternating pushdown systems

Abstract

We propose a new approach to formalize alternating pushdown systems as natural-deduction style inference systems. In this approach, the decidability of reachability can be proved as a simple consequence of a cut-elimination theorem for the corresponding inference system. Then, we show how this result can be used to extend an alternating pushdown system into a complete system where, for every configuration $A$, either $A$ or $\neg A$ is provable. The key idea is that cut-elimination permits to build a system where a proposition of the form $\neg A$ has a co-inductive (hence possibly infinite) proof if and only if it has an inductive (hence finite) proof.
Fichier principal
Vignette du fichier
reachability.pdf (183.08 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01101835 , version 1 (30-01-2015)

Licence

Identifiers

  • HAL Id : hal-01101835 , version 1

Cite

Gilles Dowek, Ying Jiang. Cut-elimination and the decidability of reachability in alternating pushdown systems. 2015. ⟨hal-01101835⟩

Collections

INRIA INRIA2
107 View
50 Download

Share

More