Hilbert's Program Then and Now

Hilbert's program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to "dispose of the foundational questions in mathematics once and for all, "Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, "finitary" means, one should give proofs of the consistency of these axiomatic systems. Although Godel's incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial successes, and generated important advances in logical theory and meta-theory, both at the time and since. The article discusses the historical background and development of Hilbert's program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s.Comment: 43 page

Finitary and Infinitary Mathematics, the Possibility of Possibilities and the Definition of Probabilities

Some relations between physics and finitary and infinitary mathematics are explored in the context of a many-minds interpretation of quantum theory. The analogy between mathematical ``existence'' and physical ``existence'' is considered from the point of view of philosophical idealism. Some of the ways in which infinitary mathematics arises in modern mathematical physics are discussed. Empirical science has led to the mathematics of quantum theory. This in turn can be taken to suggest a picture of reality involving possible minds and the physical laws which determine their probabilities. In this picture, finitary and infinitary mathematics play separate roles. It is argued that mind, language, and finitary mathematics have similar prerequisites, in that each depends on the possibility of possibilities. The infinite, on the other hand, can be described but never experienced, and yet it seems that sets of possibilities and the physical laws which define their probabilities can be described most simply in terms of infinitary mathematics.Comment: 21 pages, plain TeX, related papers from http://www.poco.phy.cam.ac.uk/~mjd101

Finitary Topos for Locally Finite, Causal and Quantal Vacuum Einstein Gravity

Previous work on applications of Abstract Differential Geometry (ADG) to discrete Lorentzian quantum gravity is brought to its categorical climax by organizing the curved finitary spacetime sheaves of quantum causal sets involved therein, on which a finitary (:locally finite), singularity-free, background manifold independent and geometrically prequantized version of the gravitational vacuum Einstein field equations were seen to hold, into a topos structure. This topos is seen to be a finitary instance of both an elementary and a Grothendieck topos, generalizing in a differential geometric setting, as befits ADG, Sorkin's finitary substitutes of continuous spacetime topologies. The paper closes with a thorough discussion of four future routes we could take in order to further develop our topos-theoretic perspective on ADG-gravity along certain categorical trends in current quantum gravity research.Comment: 49 pages, latest updated version (errata corrected, references polished) Submitted to the International Journal of Theoretical Physic

The mathematical research of William Parry FRS

In this article we survey the mathematical research of the late William (Bill) Parry, FRS

On Tao's "finitary" infinite pigeonhole principle

In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main examples was a quasi-finitization of the infinite pigeonhole principle IPP, arriving at the "finitary" infinite pigeonhole principle FIPP1. That turned out to not be the proper formulation and so we proposed an alternative version FIPP2. Tao himself formulated yet another version FIPP3 in a revised version of his essay. We give a counterexample to FIPP1 and discuss for both of the versions FIPP2 and FIPP3 the faithfulness of their respective finitization of IPP by studying the equivalences IPP FIPP2 and IPP FIPP3 in the context of reverse mathematics. In the process of doing this we also introduce a continuous uniform boundedness principle CUB as a formalization of Tao's notion of a correspondence principle and study the strength of this principle and various restrictions thereof in terms of reverse mathematics, i.e., in terms of the "big five" subsystems of second order arithmetic

`Third' Quantization of Vacuum Einstein Gravity and Free Yang-Mills Theories

Based on the algebraico-categorical (:sheaf-theoretic and sheaf cohomological) conceptual and technical machinery of Abstract Differential Geometry, a new, genuinely background spacetime manifold independent, field quantization scenario for vacuum Einstein gravity and free Yang-Mills theories is introduced. The scheme is coined `third quantization' and, although it formally appears to follow a canonical route, it is fully covariant, because it is an expressly functorial `procedure'. Various current and future Quantum Gravity research issues are discussed under the light of 3rd-quantization. A postscript gives a brief account of this author's personal encounters with Rafael Sorkin and his work.Comment: 43 pages; latest version contributed to a fest-volume celebrating Rafael Sorkin's 60th birthday (Erratum: in earlier versions I had wrongly written that the Editor for this volume is Daniele Oriti, with CUP as publisher. I apologize for the mistake.

Computational reverse mathematics and foundational analysis

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert's program due to Simpson [1988], and predicativism in the extended form due to Feferman and Sch\"{u}tte. Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only $\omega$-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a $\Pi^1_1$ complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than $\Pi^1_1\text{-}\mathsf{CA}_0$.Comment: Submitted. 41 page