Work

Cyclic proofs and size-change termination

Year: 2025

Type: article

Abstract: A cyclic proof is a regular infinite proof tree with a global condition, and it is known that, under arithmetic, cyclic proofs with inductive definitions are equivalent to proofs with induction. A way to show this equivalence is by constructing a well-founded relation on tuples of natural numbers and then transforming a cyclic proof into a proof by well-founded induction with the relation. In this paper, we see the connection between cyclic proofs and size-change termination (SCT) of programs, and it provides a new well-founded relation for proof transformation.

Source: Theoretical Computer Science

DOI: 10.1016/j.tcs.2025.115273

Author: Mirai Ikebuchi

Institution: Kyoto University

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,880

Funder: Japan Society for the Promotion of Science