On the interpretation of non-finitist proofs–Part II

Cited in

(68)

On quantitative versions of theorems due to F. E. Browder and R. Wittmann
The finitary content of sunny nonexpansive retractions
Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie
Effective metastability of Halpern iterates in \(CAT(0)\) spaces
Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
scientific article; zbMATH DE number 7577570 (Why is no real title available?)
On preserving the computational content of mathematical proofs: toy examples for a formalising strategy
A method of epsilon substitution for the predicate logic with equality
The epsilon calculus and Herbrand complexity
Nested recursion
Functorial Fast-Growing Hierarchies
On the asymptotic behavior of odd operators
A universal algorithm for Krull's theorem
Classical realizability and arithmetical formulæ
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
A complexity analysis of functional interpretations
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
Mining the surface: witnessing the low complexity theorems of arithmetic
Slow reflection
A uniform quantitative form of sequential weak compactness and Baillon's nonlinear ergodic theorem
Fifty years of the spectrum problem: survey and new results
On the No-Counterexample Interpretation
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
Nonexpansive maps in nonlinear smooth spaces
Hierarchies of number-theoretic functions. I
On Herbrand's theorem
Finite notations for infinite terms
Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
Epsilon substitution method for elementary analysis
The Gödelian inferences
Classifying the Provably Total Functions of PA
Informal versus formal mathematics
Strong termination for the epsilon substitution method
Effective results on nonlinear ergodic averages in \(\text{CAT}(\kappa)\) spaces
On the computational content of convergence proofs via Banach limits
Rates of convergence and metastability for abstract Cauchy problems generated by accretive operators
On extracting variable Herbrand disjunctions
scientific article; zbMATH DE number 7407793 (Why is no real title available?)
Computability and analysis, a historical approach
The computational content of arithmetical proofs
Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History
Subsystems of true arithmetic and hierarchies of functions
Proof-theoretical analysis: Weak systems of functions and classes
A computational study of a class of recursive inequalities
Witnessing flows in arithmetic
A classification of the ordinal recursive functions
Herbrand analyses
The mathematical significance of proof theory
A proof‐theoretic metatheorem for tracial von Neumann algebras
Proof mining for the dual of a Banach space with extensions for uniformly Fréchet differentiable functions
THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
Verificationism and Classical Realizability
On the quantitative asymptotic behavior of strongly nonexpansive mappings in Banach and geodesic spaces
Well quasi-orders and the functional interpretation
A constructive interpretation of Ramsey's theorem via the product of selection functions
Alternating (in)dependence-friendly logic
A note on inverses of elementary permutations
On modified Halpern and Tikhonov-Mann iterations
Proof mining and effective bounds in differential polynomial rings
Effective metastability for modified Halpern iterations in CAT(0) spaces
Fast growing functions based on Ramsey theorems
A new application for explanation-based generalisation within automated deduction
Dependent choice, `quote' and the clock
Realizability algebras III: some examples
Proof lengths for instances of the Paris-Harrington principle

This page was built for publication: On the interpretation of non-finitist proofs–Part II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5809142)