Leon Horsten

In his Gibbs lecture, Gödel argued for the thesis that either the human mind is not a Turing machine, or there exist absolutely undecidable mathematical propositions. He believed that this disjunction can be deduced with mathematical certainty from certain results in mathematical logic. He thought that his disjunctive thesis is of great philosophical importance. First, Gödel's argument for his disjunctive thesis is discussed. It is argued that thisargument contains an ambiguity. But when it is made precise in a certain way, the argument is seen to be ultimately inescapable. Second, the disjuncts of the thesis are considered in their own right. It is argued that there are today no convincing arguments in favor of the first disjunct, nor are there at present convincing arguments against it. But there do exist today strong reasons to believe the second disjunct to be true, although these reasons do not establish the disjunct with anything like mathematical certainty

In this contribution, we focus on probabilistic problems with a denumerably or non-denumerably infinite number of possible outcomes. Kolmogorov (1933) provided an axiomatic basis for probability theory, presented as a part of measure theory, which is a branch of standard analysis or calculus. Since standard analysis does not allow for non-Archimedean quantities (i.e. infinitesimals), we may call Kolmogorov's approach "Archimedean probability theory". We show that allowing non-Archimedean probability values may have considerable epistemological advantages in the infinite case. The current paper focuses on the motivation for our new axiomatization.

This paper investigates the role of pictures in mathematics in the particular case of Cayley graphs—the graphic representations of groups. I shall argue that their principal function in that theory—to provide insight into the abstract structure of groups—is performed employing their visual aspect. I suggest that the application of a visual graph theory in the purely non-visual theory of groups resulted in a new effective approach in which pictures have an essential role. Cayley graphs were initially developed as exact mathematical constructions. Therefore, they are legitimate components of the theory and the pictures of Cayley graphs are a part of practical mathematical procedures.

According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by models that do not instantiate this structure. Proponents of structuralism have put forward various accounts of how we succeed in fixing one single structure as the intended interpretation of our arithmetical language. We shall look at a proposal that involves Tennenbaum's theorem, which says that any model with addition and multiplication as recursive operations is isomorphic to the standard model of arithmetic. On this account, the intended models of arithmetic are the notation systems with recursive operations on them satisfying the Peano axioms. [A]m Anfang […] ist das Zeichen.

Given any finite graph, which transitive graphs approximate it most closely and how fast can we find them? The answer to this question depends on the concept of “closest approximation” involved. In [8,9] a qualitative concept of best approximation is formulated. Roughly, a qualitatively best transitive approximation of a graph is a transitive graph which cannot be “improved” without also going against the original graph. A quantitative concept of best approximation goes back at least to [10]. A quantitatively best transitive approximation is a transitive graph that makes the minimal number of mistakes against the original graph. In other words, the sum of the edges that are removed from and are added to the original graph is minimal.

The logician Kurt Godel in 1951 established a disjunctive thesis about the scope and limits of mathematical knowledge: either the mathematical mind is equivalent to a Turing machine (i.e., a computer), or there are absolutely undecidable mathematical problems. In the second half of the twentieth century, attempts have been made to arrive at a stronger conclusion. In particular, arguments have been produced by the philosopher J.R. Lucas and by the physicist and mathematician Roger Penrose that intend to show that the mathematical mind is more powerful than any computer. These arguments, and counterarguments to them, have not convinced the logical and philosophical community. The reason for this is an insufficiency if rigour in the debate. The contributions in this volume move the debate forward by formulating rigorous frameworks and formally spelling out and evaluating arguments that bear on Godel's disjunction in these frameworks. The contributions in this volume have been written by world leading experts in the field.

Williamson has forcefully argued that Fitch's argument shows that the domain of the unknowable is non-empty. And he exhorts us to make more inroads into the land of the unknowable. Concluding his discussion of Fitch's argument, he writes: " Once we acknowledge that [the domain of the unknowable] is non-empty, we can explore more effectively its extent. … We are only beginning to understand the deeper limits of our knowledge. " I shall formulate and evaluate a new argument concerning the domain of the unknowable. It is an argument about knowability. More specifically, it is an argument about what we can know about the natural numbers. Since the domain of discourse will be the natural numbers structure, the notion of knowability can for the purposes of the argument be identified with a priori knowability or – which amounts to the same thing – absolute provability .Suppose, for a reductio, that there exists a property θ of natural numbers such that it is provable that for some natural number n, θ is true but unprovable. …

It is often alleged that Cantor’s views about how the set theoretic universe as a whole should be considered are fundamentally unclear. In this article we argue that Cantor’s views on this subject, at least up until around 1896, are relatively clear, coherent, and interesting. We then go on to argue that Cantor’s views about the set theoretic universe as a whole have implications for theology that have hitherto not been sufficiently recognised. However, the theological implications in question, at least as articulated here, would not have satisfied Cantor himself.

Non-Archimedean probability functions allow us to combine regularity with perfect additivity. We discuss the philosophical motivation for a particular choice of axioms for a non-Archimedean probability theory and answer some philosophical objections that have been raised against infinitesimal probabilities in general. _1_ Introduction _2_ The Limits of Classical Probability Theory _2.1_ Classical probability functions _2.2_ Limitations _2.3_ Infinitesimals to the rescue? _3_ NAP Theory _3.1_ First four axioms of NAP _3.2_ Continuity and conditional probability _3.3_ The final axiom of NAP _3.4_ Infinite sums _3.5_ Definition of NAP functions via infinite sums _3.6_ Relation to numerosity theory _4_ Objections and Replies _4.1_ Cantor and the Archimedean property _4.2_ Ticket missing from an infinite lottery _4.3_ Williamson’s infinite sequence of coin tosses _4.4_ Point sets on a circle _4.5_ Easwaran and Pruss _5_ Dividends _5.1_ Measure and utility _5.2_ Regularity and uniformity _5.3_ Credence and chance _5.4_ Conditional probability _6_ General Considerations _6.1_ Non-uniqueness _6.2_ Invariance Appendix