| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [11 references]
https://hal.inria.fr/hal-01101835
Contributor : Gilles Dowek Connect in order to contact the contributor
Submitted on : Friday, January 30, 2015 - 12:05:31 PM
Last modification on : Friday, January 21, 2022 - 3:14:57 AM
Long-term archiving on: : Friday, September 11, 2015 - 6:27:51 AM
Contributor : Gilles Dowek Connect in order to contact the contributor
Submitted on : Friday, January 30, 2015 - 12:05:31 PM
Last modification on : Friday, January 21, 2022 - 3:14:57 AM
Long-term archiving on: : Friday, September 11, 2015 - 6:27:51 AM
Files
reachability.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution - ShareAlike 4.0 International License