Decidability, Introduction Rules and Automata
Logic in Computer Science
2016-01-08 v1
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.
Cite
@article{arxiv.1601.01484,
title = {Decidability, Introduction Rules and Automata},
author = {Gilles Dowek and Ying Jiang},
journal= {arXiv preprint arXiv:1601.01484},
year = {2016}
}
Comments
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