Priority Arguments and Epsilon Substitutions

MaRDI QIDQ3001108zbMATH OpenFDO

Authors Henry Towsner

Publication date 31 May 2011

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

zbMATH Keywords

epsilon substitution methodfinite injury methodordinal analysis

Mathematics Subject Classification ID

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

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.

Recommendations

• A framework for priority arguments
• A General Framework for Priority Arguments
• PRIORITY ARGUMENTS VIA TRUE STAGES
• Priority arguments in the continuous r.e. degrees
• Prioritized defaults and formal argumentation
• On the expressibility of priority
• scientific article; zbMATH DE number 4150132
• On the axiomatisability of priority
• On the Axiomatizability of Priority

Cited in

(4)

• Iterated trees and fragments of arithmetic
• Epsilon substitution method for \([\Pi^0_1,\Pi^0_1]\)-FIX
• Finite injury and Σ₁-induction
• PRIORITY ARGUMENTS VIA TRUE STAGES

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)