Infinitary and Cyclic Proof Systems for Transitive Closure Logic

02/02/2018
by   Liron Cohen, et al.
0

We formulate an infinitary proof system for transitive closure logic, which is the logic obtained by augmenting first-order logics with a transitive closure operator. Our system 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2022

Cyclic Proofs, Hypersequents, and Transitive Closure Logic

We propose a cut-free cyclic system for Transitive Closure Logic (TCL) b...
research
12/10/2017

Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic

A cyclic proof system gives us another way of representing inductive def...
research
03/27/2013

The Inductive Logic of Information Systems

An inductive logic can be formulated in which the elements are not propo...
research
03/11/2022

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates

The framework of cyclic proof systems provides a reasonable proof system...
research
09/07/2021

E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning

Checking the soundness of cyclic induction reasoning for first-order log...
research
09/04/2019

(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic

Reachability Logic is a formalism that can be used, among others, for ex...
research
11/24/2021

CycleQ: An Efficient Basis for Cyclic Equational Reasoning

We propose a new cyclic proof system for automated, equational reasoning...

Please sign up or login with your details

Forgot password? Click here to reset