Decidability, Introduction Rules and Automata
  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. 
Gilles Dowek (DEDUCTEAM), Ying Jiang (LCS)
cs.LO