The epsilon calculus and Herbrand complexity
type: Item
instance of: scholarly article
title: The epsilon calculus and Herbrand complexity
zbMATH Open document ID: 1097.03049
author: Georg Moser
author: Richard Zach
published in: Studia Logica
publication date: 2006-03-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0510640
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 5013040
zbMATH Keywords: Hilbert's \(\varepsilon\)-calculus
zbMATH Keywords: epsilon theorems
zbMATH Keywords: Herbrand's theorem
zbMATH Keywords: proof complexity
MaRDI profile type: Publication
OpenAlex ID: W2031927644
arXiv ID: math/0510640
cites work: Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\)
cites work: Ideas in the epsilon substitution method for \(\Pi_{1}^{0}\)-FIX
cites work: Update procedures and the 1-consistency of arithmetic
cites work: Q4304753
cites work: Hilbert's \(\varepsilon{}\)-operator and classical logic
cites work: Hilbert's ϵ‐operator in intuitionistic type theories
cites work: The Logic of Choice
cites work: Q4215630
cites work: Intuitionistic ϵ‐ and τ‐calculi
cites work: Q4298571
cites work: Q5772177
cites work: On the interpretation of non-finitist proofs–Part II
cites work: Q5582304
cites work: A termination proof for epsilon substitution using partial derivations
cites work: Q4941993
cites work: Ackermann's substitution method (remixed)
cites work: Q5731773
cites work: Lower bounds for increasing complexity of derivations after cut elimination
cites work: Lower Bounds on Herbrand's Theorem
cites work: Q4499084
cites work: Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
DOI: 10.1007/S11225-006-6610-7
description: scientific article