Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. / Cohen, Liron; Rowe, Reuben.

27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Vol. 119 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. p. 17:1-17:16 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Abstract

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive definitions, the addition of the transitive closure operator uniformly captures all finitary inductive definitions. In this paper we present an infinitary proof system for transitive closure logic which is an infinite descent-style counterpart to the existing (explicit induction) proof system for the logic. We show that, as for similar systems for first-order logic with inductive definitions, our infinitary system is complete for the standard semantics and subsumes the explicit system. Moreover, the uniformity of the transitive closure operator allows semantically meaningful complete restrictions to be defined using simple syntactic criteria. Consequently, the restriction to regular infinitary (i.e. cyclic) proofs provides the basis for an effective system for automating inductive reasoning.
Original languageEnglish
Title of host publication27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Pages17:1-17:16
Number of pages16
Volume119
ISBN (Electronic)978-3-95977-088-0
DOIs
Publication statusPublished - 4 Sep 2018

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 34708256