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.
https://hal.inria.fr/hal-01252135
Contributor : Gilles Dowek
<>
Submitted on : Thursday, January 7, 2016 - 11:50:58 AM
Last modification on : Friday, May 25, 2018 - 12:02:06 PM
Long-term archiving on : Friday, April 8, 2016 - 1:19:41 PM
Gilles Dowek, Ying Jiang. Decidability, Introduction Rules and Automata. International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Bula, Fiji. ⟨10.1007/978-3-662-48899-7_8⟩. ⟨hal-01252135⟩
