2014/02/10 by Carlos Lombardi, Lombardi, Carlos, Alejandro Ríos +3
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1402.2245
openalex publication_date 2014/02/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be faithfully represented as an infinitary proof term, which is unique up to, infinitary, associativity. Our main use of proof terms is in a definition of permutation equivalence for transfinite reductions, on the basis of permutation equations. This definition involves a variant of equational logic, adapted for dealing with infinite objects. A proof of the compression property via proof terms is presented, which establishes permutation equivalence between the original and the compressed reductions.