On the No-Counterexample Interpretation

DOI10.2307/2586791zbMath0960.03047OpenAlexW2078456795WikidataQ124853394 ScholiaQ124853394MaRDI QIDQ4948521

Ulrich Kohlenbach

Publication date: 10 May 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586791

zbMATH Keywords

bar recursionfunctional interpretationGödel's \(T\)no-counterexample interpretation

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Metamathematics of constructive systems (03F50) Relative consistency and interpretations (03F25)

Related Items (14)

Dependent choice, `quote' and the clock ⋮ Measure theory and higher order arithmetic ⋮ NON-PRINCIPAL ULTRAFILTERS, PROGRAM EXTRACTION AND HIGHER-ORDER REVERSE MATHEMATICS ⋮ On Spector's bar recursion ⋮ Term extraction and Ramsey's theorem for pairs ⋮ A UNIFORM QUANTITATIVE FORM OF SEQUENTIAL WEAK COMPACTNESS AND BAILLON'S NONLINEAR ERGODIC THEOREM ⋮ Gödel functional interpretation and weak compactness ⋮ A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM ⋮ Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs ⋮ Unnamed Item ⋮ A complexity analysis of functional interpretations ⋮ On the computational content of the Bolzano-Weierstraß Principle ⋮ Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness

Cites Work

• Unnamed Item
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• The syntax and semantics of infinitary languages
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• On n-quantifier induction
• On the Interpretation of Non-Finitist Proofs--Part I
• On the interpretation of non-finitist proofs–Part II

This page was built for publication: On the No-Counterexample Interpretation