Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
From MaRDI portal
Publication:3699687
DOI10.2307/2274319zbMath0578.03030OpenAlexW2028602249MaRDI QIDQ3699687
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274319
Related Items
On Spector's bar recursion ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Some logical metatheorems with applications in functional analysis ⋮ Strong normalization of barrecursive terms without using infinite terms ⋮ Bounded functional interpretation and feasible analysis ⋮ Equivalence of bar recursors in the theory of functionals of finite type ⋮ Polymorphic extensions of simple type structures. With an application to a bar recursive minimization ⋮ The equivalence of bar recursion and open recursion ⋮ A UNIFORM QUANTITATIVE FORM OF SEQUENTIAL WEAK COMPACTNESS AND BAILLON'S NONLINEAR ERGODIC THEOREM ⋮ A proof‐theoretic metatheorem for tracial von Neumann algebras ⋮ Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic ⋮ On bounded functional interpretations ⋮ Logical metatheorems for abstract spaces axiomatized in positive bounded logic ⋮ The bounded functional interpretation of bar induction ⋮ Primitive recursion and the chain antichain principle ⋮ Intuitionistic nonstandard bounded modified realisability and functional interpretation ⋮ Gödel functional interpretation and weak compactness ⋮ Unnamed Item ⋮ An application of proof mining to nonlinear iterations ⋮ The abstract type of the real numbers ⋮ Selection functions, bar recursion and backward induction ⋮ Compact and majorizable functionals of finite type ⋮ Bar recursion over finite partial functions ⋮ Proof Mining in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="double-struck">R</mml:mi></mml:math>-trees and Hyperbolic Spaces ⋮ Functional interpretations of linear and intuitionistic logic ⋮ Bounded functional interpretation ⋮ Strongly uniform bounds from semi-constructive proofs ⋮ On the computational content of the Bolzano-Weierstraß Principle ⋮ General logical metatheorems for functional analysis ⋮ Injecting uniformities into Peano arithmetic ⋮ Metastability of the proximal point algorithm with multi-parameters ⋮ THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT ⋮ Unnamed Item ⋮ A generalization of Nash's theorem with higher-order functionals ⋮ A Rate of Metastability for the Halpern Type Proximal Point Algorithm ⋮ Sequential games and optimal strategies ⋮ Confined modified realizability ⋮ A note on the monotone functional interpretation ⋮ On the removal of weak compactness arguments in proof mining ⋮ Functional interpretation of Aczel's constructive set theory ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness ⋮ Classical provability of uniform versions and intuitionistic provability ⋮ Nonstandardness and the bounded functional interpretation ⋮ Pointwise hereditary majorization and some applications
