A termination proof for epsilon substitution using partial derivations

DOI10.1016/S0304-3975(02)00451-6zbMath1032.03046MaRDI QIDQ1401363

Grigori Mints

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

epsilon substitution methodextraction of programsincomplete proofsinfinite proofs

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (2)

Ackermann's substitution method (remixed) ⋮ The epsilon calculus and Herbrand complexity

Cites Work

• A new reduction sequence for arithmetic
• Finite investigations of transfinite derivations
• Epsilon substitution method for theories of jump hierarchies
• Epsilon substitution method for elementary analysis
• Notation systems for infinitary derivations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A termination proof for epsilon substitution using partial derivations