Well Quasi-orders and the Functional Interpretation

DOI10.1007/978-3-030-30229-0_9zbMath1496.03234arXiv1706.02881OpenAlexW2622007578MaRDI QIDQ3295153

No author found.

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35) Metamathematics of constructive systems (03F50) Axiom of choice and related propositions (03E25) Higher-type and set recursion theory (03D65)

Related Items (3)

A universal algorithm for Krull's theorem ⋮ Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ Dependent choice as a termination principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence of bar recursion and open recursion
• Proving open properties by induction
• Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
• Certified Kruskal’s Tree Theorem
• Sequential games and optimal strategies
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Higher-Order Computability
• Selection functions, bar recursion and backward induction
• Gödel's functional interpretation and the concept of learning
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• On the Interpretation of Non-Finitist Proofs--Part I
• On the interpretation of non-finitist proofs–Part II
• Ordering by Divisibility in Abstract Algebras
• Logical Approaches to Computational Barriers

This page was built for publication: Well Quasi-orders and the Functional Interpretation