Logical Approaches to Computational Barriers
From MaRDI portal
Publication:5898840
DOI10.1007/11780342zbMath1145.68421WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898840
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
03D65: Higher-type and set recursion theory
Related Items
Unnamed Item, Unnamed Item, A note on the finitization of Abelian and Tauberian theorems, The bounded functional interpretation of bar induction, Delimited control operators prove double-negation shift, Bar recursion over finite partial functions, Proof mining and effective bounds in differential polynomial rings, Metastability of the proximal point algorithm with multi-parameters, Light Dialectica Program Extraction from a Classical Fibonacci Proof, Well Quasi-orders and the Functional Interpretation