Exploring the Computational Content of the Infinite Pigeonhole Principle

DOI10.1093/LOGCOM/EXQ011zbMath1259.03072OpenAlexW2006395151MaRDI QIDQ2882563

Trifon Trifonov, Diana Ratiu

Publication date: 7 May 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq011

zbMATH Keywords

Dialectica interpretationprogram extractionA-translationnonconstructive proofsinfinite pigeonhole principle

Mathematics Subject Classification ID

Logic in computer science (03B70) Ramsey theory (05D10) Functionals in proof theory (03F10) Complexity of proofs (03F20)

Related Items (6)

Unnamed Item ⋮ Herbrand's theorem as higher order recursion ⋮ Proofs, programs, processes ⋮ The computational content of arithmetical proofs ⋮ On the form of witness terms ⋮ Expansion trees with cut

This page was built for publication: Exploring the Computational Content of the Infinite Pigeonhole Principle