After sketching the main lines of Hilbert's program, certain well-known andinfluential interpretations of the program are critically evaluated, and analternative interpretation is presented. Finally, some recent developments inlogic related to Hilbert's program are reviewed.

The article begins and ends with reminiscences and reflections about conversations with Myhill . The topic in the title was never far from these conversations, but remained off stage: questions about the suitability of the focus on logical languages and logical consequence, here meant in contrast to incomparable categories of propositions and proofs. The body of the article goes into cases where this focus has contributed to—and where it has distracted from more rewarding categories for—effective knowledge in mathematics. There are (...) some rules of thumb for recognizing distractions, and for doing better. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...) Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

I attribute an 'intensional reading' of the second incompleteness theorem to its author, Kurt G del. My argument builds partially on an analysis of intensional and extensional conceptions of meta-mathematics and partially on the context in which G del drew two familiar inferences from his theorem. Those inferences, and in particular the way that they appear in G del's writing, are so dubious on the extensional conception that one must doubt that G del could have understood his theorem extensionally. However, (...) on the intensional conception, the inferences are straightforward. For that reason I conclude that G del had an intensional understanding of his theorem. Since this conclusion is in tension with the generally accepted view of G del's understanding of mathematical truth, I explain how to reconcile that view with the intensional reading of the theorem that I attribute to G del. The result is a more detailed account of G del's conception of meta-mathematics than is currently available. (shrink)

Toisaalta ennennäkemätön äärettömien joukko-opillisten menetelmien hyödyntäminen sekä toisaalta epäilyt niiden hyväksyttävyydestä ja halu oikeuttaa niiden käyttö ovat ratkaisevasti muovanneet vuosisatamme matematiikkaa ja logiikkaa. Tämän kehityksen vaikutus nykyajan filosofiaan on myös ollut valtaisa; merkittävää osaa siitä ei voi edes ymmärtää tuntematta sen yhteyttä tähän matematiikan ja logiikan vallankumoukseen. Lähestymistapoja, jotka tavalla tai toisella hyväksyvät äärettömän matematiikan ja perinteisten logiikan sääntöjen (erityisesti kolmannen poissuljetun lain) soveltamisen myös sen piirissä, on tullut tavaksi kutsua klassiseksi matematiikaksi ja logiikaksi erotuksena nämä hylkäävistä radikaaleista intuitionistisista ja (...) konstruktivistisista opeista. (shrink)

Jean van Heijenoort was best known for his editorial work in the history of mathematical logic. I survey his contributions to model-theoretic proof theory, and in particular to the falsifiability tree method. This work of van Heijenoort’s is not widely known, and much of it remains unpublished. A complete list of van Heijenoort’s unpublished writings on tableaux methods and related work in proof theory is appended.

Herbrand's Theorem, in the form of $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\exists } $$ -inversion lemmata for finitary and infinitary sequent calculi, is the crucial tool for the determination of the provably total function(al)s of a variety of theories. The theories are (second order extensions of) fragments of classical arithmetic; the classes of provably total functions include the elements of the Polynomial Hierarchy, the Grzegorczyk Hierarchy, and the extended Grzegorczyk Hierarchy $\mathfrak{E}^\alpha $ , α < ε0. A subsidiary aim of the paper is to show (...) that the proof theoretic methods used here are distinguished by technical elegance, conceptual clarity, and wide-ranging applicability. (shrink)

Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded middle and which involve only two quantifier alternations. By contrast, we show that the proof mining of classical Nonstandard Analysis has a very (...) large scope. In particular, we will observe that this scope includes any theorem of pure Nonstandard Analysis, where 'pure' means that only nonstandard definitions are used. In this note, we survey results in analysis, computability theory, and Reverse Mathematics. (shrink)

In [15], [16] G. Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated ε-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functionals Φ A of order type 0 which realize the Herbrand normal form A H of A. Subsequently more perspicuous proofs of this fact via functional interpretation (combined with normalization) and cut-elimination were found. These proofs however do (...) not carry out the no-counterexample interpretation as a local proof interpretation and don't respect the modus ponens on the level of the no-counterexample interpretation of formulas A and A → B. Closely related to this phenomenon is the fact that both proofs do not establish the condition (δ) and--at least not constructively-- (γ) which are part of the definition of an 'interpretation of a formal system' as formulated in [15]. In this paper we determine the complexity of the no-counterexample interpretation of the modus ponens rule for (i) PA-provable sentences, (ii) for arbitrary sentences A, B ∈ L(PA) uniformly in functionals satisfying the no-counterexample interpretation of (prenex normal forms of) A and A → B, and (iii) for arbitrary A, B ∈ L(PA) pointwise in given α( 0 ) -recursive functionals satisfying the no-counterexample interpretation of A and A → B. This yields in particular perspicuous proofs of new uniform versions of the conditions (γ), (δ). Finally we discuss a variant of the concept of an interpretation presented in [17] and show that it is incomparable with the concept studied in [15], [16]. In particular we show that the no-counterexample interpretation of PA n by α( n (ω))-recursive functionals (n ≥ 1) is an interpretation in the sense of [17] but not in the sense of [15] since it violates the condition (δ). (shrink)

This paper presents a constructive interpretation for the proofs in classical logic of $\Sigma^0_1$ -sentences and for a witness extraction procedure based on Prawitz's reduction rules.

In this paper we give a strong normalization proof for a set of reduction rules for classical logic. These reductions, more general than the ones usually considered in literature, are inspired to the reductions of Felleisen's lambda calculus with continuations.