Priority Arguments and Epsilon Substitutions

zbMATH Open1239.03036arXiv0812.3434MaRDI QIDQ3001108

Henry Towsner

Publication date: 31 May 2011

Abstract: Kreisel has observed that the termination proof for Hilbert's epsilon-substitution method bears a resemblance to the priority arguments used in recursion theory. We make this precise by proving the termination using a framework for priority arguments due to Lerman and Lempp.

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

zbMATH Keywords

ordinal analysisepsilon substitution methodfinite injury method

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursively (computably) enumerable sets and degrees (03D25) Recursive ordinals and ordinal notations (03F15)

Related Items (1)

PRIORITY ARGUMENTS VIA TRUE STAGES

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the expressibility of priority 👍 👎
• On the Axiomatizability of Priority 👍 👎
• Priority arguments in the continuous r.e. degrees 👍 👎
• A General Framework for Priority Arguments 👍 👎
• PRIORITY ARGUMENTS VIA TRUE STAGES 👍 👎
• On the axiomatisability of priority 👍 👎

This page was built for publication: Priority Arguments and Epsilon Substitutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001108)