A constructive interpretation of Ramsey's theorem via the product of selection functions

DOI10.1017/S0960129513000340zbMath1362.03051arXiv1204.5631OpenAlexW2964118126MaRDI QIDQ5740680

No author found.

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Other constructive mathematics (03F65) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35)

Related Items (5)

A note on the finitization of Abelian and Tauberian theorems ⋮ Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs ⋮ An intuitionistic version of Ramsey's theorem and its use in program termination ⋮ A compositional treatment of iterated open games

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey's theorem for pairs and provably recursive functions
• The metamathematics of ergodic theory
• Combinatorial set theory: Partition relations for cardinals
• Handbook of proof theory
• An analysis of Ramsey's theorem
• Sequential games and optimal strategies
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Selection functions, bar recursion and backward induction
• Computational Interpretations of Analysis via Products of Selection Functions
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• On the interpretation of non-finitist proofs–Part II

This page was built for publication: A constructive interpretation of Ramsey's theorem via the product of selection functions