Indeterminacy in Mathematics

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. -/- The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the `width' of the set theoretic universe, such as Cantor's continuum hypothesis. In the higher-order framework I show that contingency about (...) the width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the `Leibniz biconditionals' stating that what is possible, in the broadest sense of possible, is what is true in some possible world. Nonetheless, I argue that the underlying picture of modal set-theory is coherent and has natural models. (shrink)

It's currently fashionable to take Putnamian model theoretic worries seriously for mathematics, but not for discussions of ordinary physical objects and the sciences. But I will argue that (under certain mild assumptions) merely securing determinate reference to physical possibility suffices to rule out nonstandard models of our talk of numbers. So anyone who accepts realist reference to physical possibility should not reject reference to the standard model of the natural numbers on Putnamian model theoretic grounds.

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

Modal logic has been used to analyze potential infinity and potentialism more generally. However, the standard analysis breaks down in cases of divergent possibilities, where there are two or more possibilities that can be individually realized but which are jointly incompatible. This paper has three aims. First, using the intuitionistic theory of choice sequences, we motivate the need for a modal analysis of divergent potentialism and explain the challenges this involves. Then, using Beth–Kripke semantics for intuitionistic logic, we overcome those (...) challenges. Finally, we apply our modal analysis of divergent potentialism to make choice sequences comprehensible in classical terms. (shrink)

In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...) and hence is incomplete. Whilst this might initially seem strange, I show how internal categoricity results for arithmetic and set theory allow us to face up to this Antinomy. This also allows us to understand why “Models are not lost noumenal waifs looking for someone to name them,” but “constructions within our theory itself,” with “names from birth.”. (shrink)

Benacerraf’s 1965 multiple-reductions argument depends on what I call ‘deferential logicism’: his necessary condition for number-set identity is most plausible against a background Quineanism that allows autonomy of the natural number concept. Steinhart’s ‘folkist’ sufficient condition on number-set identity, by contrast, puts that autonomy at the center — but fails for not taking the folk perspective seriously enough. Learning from both sides, we explore new conditions on number-set identity, elaborating a suggestion from Wright.

This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions. -/- Underlying this argument is the following philosophical view. Mathematical belief springs from certain intuitions, each of which can be either accepted or doubted in its entirety, but not half-accepted. Therefore, our beliefs about reality, bivalence, choice and consistency should all be aligned.

Computational physical systems may exhibit indeterminacy of computation (IC). Their identified physical dynamics may not suffice to select a unique computational profile. We consider this phenomenon from the point of view of cognitive science and examine how computational profiles of cognitive systems are identified and justified in practice, in the light of IC. To that end, we look at the literature on the underdetermination of theory by evidence and argue that the same devices that can be successfully employed to confirm (...) physical hypotheses can also be used to rationally single out computational profiles, notwithstanding IC. (shrink)

This paper develops an account of pluralities based on the following simple claim: some things are nothing over and above the individual things they comprise. For some, this may seem like a mysterious statement, perhaps even meaningless; for others, like a truism, trivial and inferentially inert. I show that neither reaction is correct: the claim is both tractable and has important consequences for a number of debates in philosophy.

Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic. Recasting this result in higher-order logic reveals that even the nominalist who thinks that there are only finitely many things should think that (...) there is some sense in which arithmetic is true and determinate. (shrink)

Rudolf Carnap’s principle of tolerance states that there is no need to justify the adoption of a logic by philosophical means. Carnap uses the freedom provided by this principle in his philosophy of mathematics: he wants to capture the idea that mathematical truth is a matter of linguistic rules by relying on a strong metalanguage with infinitary inference rules. In this paper, I give a new interpretation of an argument by E. W. Beth, which shows that the principle of tolerance (...) does not suffice to remove all obstacles to the employment of infinitary rules. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order PA and Zermelo’s quasi-categoricity (...) theorem for second-order ZFC—these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Complexity is dependent on the circular-linear relationship between an individual and a group, meaning we cannot use 'observation' to tell us what we need to know (to explain complexity).

Putnam’s model-theoretic arguments for the indeterminacy of reference have been taken to pose a special problem for mathematical languages. In this paper, I argue that if one accepts that there are theory-external constraints on the reference of at least some expressions of ordinary language, then Putnam’s model-theoretic arguments for mathematical languages don’t go through. In particular, I argue for a kind of descriptivism about mathematical expressions according to which their reference is “anchored” in the reference of expressions of ordinary language. (...) These anchors add enough to the content of mathematical expressions to forestall the radical kind of indeterminacy that model-theoretic arguments are purported to show, while still leaving room for a plausible, moderate kind of indeterminacy. (shrink)

This paper investigates the determinacy of mathematics. We begin by clarifying how we are understanding the notion of determinacy before turning to the questions of whether and how famous independence results bear on issues of determinacy in mathematics. From there, we pose a metasemantic challenge for those who believe that mathematical language is determinate, motivate two important constraints on attempts to meet our challenge, and then use these constraints to develop an argument against determinacy and discuss a particularly popular approach (...) to resolving indeterminacy, before offering some brief closing reflections. We believe our discussion poses a serious challenge for most philosophical theories of mathematics, since it puts considerable pressure on all views that accept a non-trivial amount of determinacy for even basic arithmetic. (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

It is usual to identify initial conditions of classical dynamical systems with mathematical real numbers. However, almost all real numbers contain an infinite amount of information. I argue that a finite volume of space can’t contain more than a finite amount of information, hence that the mathematical real numbers are not physically relevant. Moreover, a better terminology for the so-called real numbers is “random numbers”, as their series of bits are truly random. I propose an alternative classical mechanics, which is (...) empirically equivalent to classical mechanics, but uses only finite-information numbers. This alternative classical mechanics is non-deterministic, despite the use of deterministic equations, in a way similar to quantum theory. Interestingly, both alternative classical mechanics and quantum theories can be supplemented by additional variables in such a way that the supplemented theory is deterministic. Most physicists straightforwardly supplement classical theory with real numbers to which they attribute physical existence, while most physicists reject Bohmian mechanics as supplemented quantum theory, arguing that Bohmian positions have no physical reality. (shrink)

A version of the permutation argument in the philosophy of mathematics leads to the thesis that mathematical terms, contrary to appearances, are not genuine singular terms referring to individual objects; they are purely schematic or variables. By postulating ‘ante-rem structures’, the ante-rem structuralist aims to defuse the permutation argument and retain the referentiality of mathematical terms. This paper presents two semantic problems for the ante- rem view: (1) ante-rem structures are themselves subject to the permutation argument; (2) the ante-rem structuralist (...) fails to explain reference in a way that makes her account different to, and privileged over, that of her eliminativist rivals. Both problems undercut the motivation behind ante-rem structuralism. (shrink)

Philosophy and model theory frequently meet one another. Philosophy and Model Theory aims to understand their interactions -/- Model theory is used in every ‘theoretical’ branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging appeals to model theory have created a highly fragmented literature. On the one hand, many philosophically significant mathematical results are found only in mathematics textbooks: these are aimed squarely at mathematicians; (...) they typically presuppose that the reader has a significant background in mathematics; and little clue is given as to their philosophical significance. On the other hand, the philosophical applications of these results are then scattered across disconnected pockets of papers, separated by decades or more. -/- The first aim of Philosophy and Model Theory, then, is to consider the philosophical uses of model theory. On a technical level, we try to show how philosophically significant results connect to one another, and also to state the best version of a result for philosophical purposes. On a philosophical level, we show how similar dialectical situations arise repeatedly, across fragmented debates in varied philosophical areas. -/- The second aim of Philosophy and Model Theory, though, is to consider the philosophy of model theory. Model theory itself is rarely taken as the subject matter of philosophising (contrast this, say, with the philosophy of biology, or the philosophy of set theory). But model theory is a beautiful part of pure mathematics, and worthy of philosophical study in its own right. (shrink)

there are mathematical statements that cannot be proved or refuted using the usual axioms and rules of inference of mathematics.

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

Mathematical realists have long invoked the categoricity of axiomatizations of arithmetic and analysis to explain how we manage to fix the intended meaning of their respective vocabulary. Can this strategy be extended to set theory? Although traditional wisdom recommends a negative answer to this question, Vann McGee (1997) has offered a proof that purports to show otherwise. I argue that one of the two key assumptions on which the proof rests deprives McGee's result of the significance he and the realist (...) want to attribute to it. I consider two strategies to deal with the problem --- one of which is outlined by McGee himself (2000) --- and argue that both of them fail. I end with some remarks on the prospects for mathematical realism in the light of my discussion. (shrink)

The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...) (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...) towards a sense in which portions of our computational vocabulary should be regarded as model-relative. (shrink)

It is often alleged that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...) hypothesis is absolutely undecidable, then it is indeterminate. I shall argue that on no understanding of absolute undecidability could one hope to establish all of (a)–(c). However, I will identify one understanding of absolute undecidability on which one might hope to establish both (a) and (c) to the exclusion of (b). This suggests that a new style of mathematical antirealism deserves attention—one that does not depend on familiar epistemological or ontological concerns. The key idea behind this view is that typical mathematical hypotheses are indeterminate because they are relevantly similar to CH. (shrink)

Tennenbaum's Theorem yields an elegant characterisation of the standard model of arithmetic. Several authors have recently claimed that this result has important philosophical consequences: in particular, it offers us a way of responding to model-theoretic worries about how we manage to grasp the standard model. We disagree. If there ever was such a problem about how we come to grasp the standard model, then Tennenbaum's Theorem does not help. We show this by examining a parallel argument, from a simpler model-theoretic (...) result. (shrink)

Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted models. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I examine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to metamathematical challenges.

This article presents an explication of the references to the history of the calculus in the first few pages of Chapter 4 of Deleuze's _Difference and Repetition_. In those pages, Deleuze uses anachronistic readings of the calculus to explain his theory of ontogenesis, beginning with the differential, dx, that is strictly nothing by itself but that establishes singular points in relation to other differentials. He builds from the differential to power series, showing a corresponding process of determination in the ontogenesis (...) as the mathematics moves from derivative to the so-called original function. (shrink)

A lucid, elegant, and complete survey of set theory, this three-part treatment explores axiomatic set theory, the consistency of the continuum hypothesis, and forcing and independence results. 1996 edition.

In this paper, I argue against Penelope Maddy's set-theoretic realism by arguing (1) that it is perfectly consistent with mathematical Platonism to deny that there is a fact of the matter concerning statements which are independent of the axioms of set theory, and that (2) denying this accords further that many contemporary Platonists assert that there is a fact of the matter because they are closet foundationalists, and that their brand of foundationalism is in radical conflict with actual mathematical practice.

The purpose of this article is to explain why I believe that the Continuum Hypothesis (CH) is not a definite mathematical problem. My reason for that is that the concept of arbitrary set essential to its formulation is vague or underdetermined and there is no way to sharpen it without violating what it is supposed to be about. In addition, there is considerable circumstantial evidence to support the view that CH is not definite.

A disagrees with B with respect to a proposition, p, flawlessly just in case A believes p and B believes not-p, or vice versa, though neither A nor B is guilty of a cognitive shortcoming – i.e. roughly, neither A nor B is being irrational, lacking evidence relevant to p, conceptually incompetent, insufficiently imaginative, etc.