Name
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. |
Year | Venue | Field |
|---|---|---|
2018 | CSL | Inductive reasoning,Discrete mathematics,Algebra,Computer science,Mathematical proof,Finitary,Proof by infinite descent,Operator (computer programming),Transitive closure,Syntax,Computer programming |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liron Cohen | 1 | 36 | 11.24 |
| Reuben N. S. Rowe | 2 | 25 | 7.52 |