Decidability, introduction rules and automata

DOI10.1007/978-3-662-48899-7_8zbMATH Open1471.03012arXiv1601.01484OpenAlexW2229700847MaRDI QIDQ3460044FDOQ3460044

Authors: Gilles Dowek, Ying Jiang 

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1601.01484

Recommendations

• scientific article; zbMATH DE number 1342250
• Automatic recognition of tractability in inference relations
• The development of decidability proofs based on sequent calculi
• scientific article; zbMATH DE number 3841819
• ADMISSIBILITY OF RULES OF INFERENCE, AND LOGICAL EQUATIONS, IN MODAL LOGICS AXIOMATIZING PROVABILITY

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Cut-elimination and normal-form theorems (03F05) Decidability of theories and sets of sentences (03B25)

Cited In (6)

• Deciding properties of integral relational automata
• Decidability of equivalence of symbolic derivations
• Title not available (Why is that?)
• Title not available (Why is that?)
• The development of decidability proofs based on sequent calculi
• Automatic Decidability and Combinability Revisited

This page was built for publication: Decidability, introduction rules and automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460044)