Decidability, Introduction Rules and Automata
arXiv:1601.01484 · doi:10.1007/978-3-662-48899-7_8
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.
International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Bula, Fiji. 2015, International Conferences on Logic for Programming, Artificial Intelligence and Reasoning