Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
intro.pdf (178.87 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01252135 , version 1 (07-01-2016)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
71 View
196 Download

Altmetric

Share

More