Exact bounds on epsilon processes

DOI10.1007/S00153-010-0225-4zbMath1225.03074arXiv1005.2003OpenAlexW2099914258MaRDI QIDQ535160

Toshiyasu Arai

Publication date: 11 May 2011

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.2003

zbMATH Keywords

cut-eliminationepsilon substitutiontermination proof

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

Herbrand complexity and the epsilon calculus with equality

Cites Work

• Nested recursion
• Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\)
• Epsilon substitution method for theories of jump hierarchies
• Ideas in the epsilon substitution method for \(\Pi_{1}^{0}\)-FIX
• Epsilon substitution method for \([\Pi^0_1,\Pi^0_1\)-FIX]
• Epsilon substitution method for -FIX
• Functionals defined by transfinite recursion

This page was built for publication: Exact bounds on epsilon processes