| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Decidability, Introduction Rules and Automata
Abstract : We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
Cited literature [13 references]
https://hal.inria.fr/hal-01252135
Contributor : Gilles Dowek Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2016 - 11:50:58 AM
Last modification on : Friday, January 21, 2022 - 3:13:55 AM
Long-term archiving on: : Friday, April 8, 2016 - 1:19:41 PM
Contributor : Gilles Dowek Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2016 - 11:50:58 AM
Last modification on : Friday, January 21, 2022 - 3:13:55 AM
Long-term archiving on: : Friday, April 8, 2016 - 1:19:41 PM
Files
intro.pdf
Files produced by the author(s)