Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.68421OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898840

Paulo Oliva

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items (10)

A note on the finitization of Abelian and Tauberian theorems ⋮ The bounded functional interpretation of bar induction ⋮ Proof mining and effective bounds in differential polynomial rings ⋮ Delimited control operators prove double-negation shift ⋮ Unnamed Item ⋮ Well Quasi-orders and the Functional Interpretation ⋮ Bar recursion over finite partial functions ⋮ Metastability of the proximal point algorithm with multi-parameters ⋮ Unnamed Item ⋮ Light Dialectica Program Extraction from a Classical Fibonacci Proof

This page was built for publication: Logical Approaches to Computational Barriers