In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by Lifschitz (Proc Am Math Soc 73:101–106, 1979). A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten (J Symb Log 55:805–821, 1990). In that paper he also extended Lifschitz’ realizability to second order arithmetic. The objective here is to extend it to full intuitionistic Zermelo–Fraenkel set theory, IZF. The machinery (...) would also work for extensions of IZF with large set axioms. In addition to separating Church’s thesis with uniqueness condition from its general form in intuitionistic set theory, we also obtain several interesting corollaries. The interpretation repudiates a weak form of countable choice, ACω,ω, asserting that a countable family of inhabited sets of natural numbers has a choice function. ACω,ω is validated by ordinary Kleene realizability and is of course provable in ZF. On the other hand, a pivotal consequence of ACω,ω, namely that the sets of Cauchy reals and Dedekind reals are isomorphic, remains valid in this interpretation. Another interesting aspect of this realizability is that it validates the lesser limited principle of omniscience. (shrink)

The aim of this article is to give an introduction to functional interpretations of set theory given by the authorin Burr (2000a). The first part starts with some general remarks on Gödel's functional interpretation with a focus on aspects related to problems that arise in the context of set theory. The second part gives an insight in the techniques needed to perform a functional interpretation of systems of set theory. However, the first part of this article is not intended to (...) be a complete survey of functional interpretations and here we recommend, for example, Avigad and Feferman (1998),Troelstra (1990) and Troelstra (1973). (shrink)

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

The nature of modern constructive mathematics, and its applications, actual and potential, to classical and quantum physics, are discussed.

One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.

The representational theory of measurement has long been the central paradigm in the philosophy of measurement. Such is not the case anymore, partly under the influence of the critique according to which RTM offers too poor descriptions of the measurement procedures actually followed in science. This can be called the metrological critique of RTM. I claim that the critique is partly irrelevant. This is because, in general, RTM is not in the business of describing measurement procedures, be it in idealized (...) form. To support this claim, I present various cases where RTM can be said to investigate measurement without providing any measurement procedure. Such limit cases lead to a better understanding of the RTM project. They also illustrate some of the questions which the philosophy of measurement can explore, when it is ready to go beyond the metrological viewpoint. (shrink)

is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that there are many criteria by which ordinary proofs are valued. I argue that at least some of these criteria depend on the methods of inference the proofs employ, and that (...) standard models of formal deduction are not well-equipped to support such evaluations. I discuss a model of proof that is used in the automated deduction community, and show that this model does better in that respect. (shrink)

The small, the tiny, and the infinitesimal have been the object of both fascination and vilification for millenia. One of the most vitriolic reviews in mathematics was that written by Errett Bishop about Keisler’s book Elementary Calculus: an Infinitesimal Approach. In this skit we investigate both the argument itself, and some of its roots in Bishop George Berkeley’s criticism of Leibnizian and Newtonian Calculus. We also explore some of the consequences to students for whom the infinitesimal approach is congenial. The (...) casual mathematical reader may be satisfied to read the text of the five act play, whereas the others may wish to delve into the 130 footnotes, some of which contain elucidation of the mathematics or comments on the history. (shrink)

Brouwer's demonstration of his Bar Theorem gives rise to provocative questions regarding the proper explanation of the logical connectives within intuitionistic and constructivist frameworks, respectively, and, more generally, regarding the role of logic within intuitionism. It is the purpose of the present note to discuss a number of these issues, both from an historical, as well as a systematic point of view.

The essays in this volume concern the points of intersection between analytic philosophy and the philosophy of the exact sciences. More precisely, it concern connections between knowledge in mathematics and the exact sciences, on the one hand, and the conceptual foundations of knowledge in general. Its guiding idea is that, in contemporary philosophy of science, there are profound problems of theoretical interpretation-- problems that transcend both the methodological concerns of general philosophy of science, and the technical concerns of philosophers of (...) particular sciences. A fruitful approach to these problems combines the study of scientific detail with the kind of conceptual analysis that is characteristic of the modern analytic tradition. Such an approach is shared by these contributors: some primarily known as analytic philosophers, some as philosophers of science, but all deeply aware that the problems of analysis and interpretation link these fields together. (shrink)

Intersemiotic translation (IT) was defined by Roman Jakobson (The Translation Studies Reader, Routledge, London, p. 114, 2000) as “transmutation of signs”—“an interpretation of verbal signs by means of signs of nonverbal sign systems.” Despite its theoretical relevance, and in spite of the frequency in which it is practiced, the phenomenon remains virtually unexplored in terms of conceptual modeling, especially from a semiotic perspective. Our approach is based on two premises: (i) IT is fundamentally a semiotic operation process (semiosis) and (ii) (...) IT is a deeply iconic-dependent process. We exemplify our approach by means of literature to dance IT and we explore some implications for the development of a general model of IT. (shrink)

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...) rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism, via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction. (shrink)

This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...) today is predicativistic constructivism based on Martin-Löf type theory. Associated philosophical foundations are meaning theories in the tradition of Wittgenstein, Dummett, Prawitz and Martin-Löf. What is the relation between proof-theoretical semantics in the tradition of Gentzen, Prawitz, and Martin-Löf and Wittgensteinian or other accounts of meaning-as-use? What can proof-theoretical analyses tell us about the scope and limits of constructive and predicative mathematics? (shrink)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

This anthology of the very latest research on truth features the work of recognized luminaries in the field, put together following a rigorous refereeing process. Along with an introduction outlining the central issues in the field, it provides a unique and unrivaled view of contemporary work on the nature of truth, with papers selected from key conferences in 2011 such as Truth Be Told, Truth at Work, Paradoxes of Truth and Denotation and Axiomatic Theories of Truth. Studying the nature of (...) the concept of ‘truth’ has always been a core role of philosophy, but recent years have been a boom time in the topic. With a wealth of recent conferences examining the subject from various angles, this collection of essays recognizes the pressing need for a volume that brings scholars up to date on the arguments. Offering academics and graduate students alike a much-needed repository of today’s cutting-edge work in this vital topic of philosophy, the volume is required reading for anyone needing to keep abreast of developments, and is certain to act as a catalyst for further innovation and research. (shrink)

The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic MathematicsBIM, and then search for statements that are, over BIM, equivalent to Brouwer’s Fan Theorem or to its positive denial, Kleene’s Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene’s Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene’s Alternative is, intuitionistically, a nontrivial extension (...) of the task of finding equivalents of the Fan Theorem, although there is a certain symmetry in the arguments that we shall try to make transparent. We introduce closed-and-separable subsets of Baire space N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{N}}$$\end{document} and of the set R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{R}}$$\end{document} of the real numbers. Such sets may be compact and also positively noncompact. The Fan Theorem is the statement that Cantor space C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}, or, equivalently, the unit interval [0, 1], is compact and Kleene’s Alternative is the statement that C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}, or, equivalently, [0, 1], is positively noncompact. The class of the compact closed-and-separable sets and also the class of the closed-and-separable sets that are positively noncompact are characterized in many different ways and a host of equivalents of both the Fan Theorem and Kleene’s Alternative is found. (shrink)

Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.

Transfinite recursion is an essential component of set theory. In this paper, we seek intrinsically justified reasons for believing in recursion and the notions of higher computation that surround it. In doing this, we consider several kinds of recursion principles and prove results concerning their relation to one another. We then consider philosophical motivations for these formal principles coming from the idea that computational notions lie at the core of our conception of set. This is significant because, while the iterative (...) conception of set has been widely recognized as insufficient to establish replacement and recursion, its supplementation by considerations pertaining to algorithms suggests a new and philosophically well-motivated reason to believe in such principles. (shrink)

We describe a variety of sets internal to models of intuitionistic set theory that (1) manifest some of the crucial behaviors of potentially infinite sets as described in the foundational literature going back to Aristotle, and (2) provide models for systems of predicative arithmetic. We close with a brief discussion of Church’s Thesis for predicative arithmetic.

In this paper, elementary but hitherto overlooked connections are established between Wittgenstein's remarks on mathematics, written during his transitional period, and free-variable finitism. After giving a brief description of theTractatus Logico-Philosophicus on quantifiers and generality, I present in the first section Wittgenstein's rejection of quantification theory and his account of general arithmetical propositions, to use modern jargon, as claims (as opposed to statements). As in Skolem's primitive recursive arithmetic and Goodstein's equational calculus, Wittgenstein represented generality by the use of free (...) variables. This has the effect that negation of unbounded universal and existential propositions cannot be expressed. This is claimed in the second section to be the basis for Wittgenstein's criticism of the universal validity of the law of excluded middle. In the last section, there is a brief discussion of Wittgenstein's remarks on real numbers. These show a preference, in line with finitism, for a recursive version of the continuum. (shrink)

The aim of this paper is to clarify the role of category theory in the foundations of mathematics. There is a good deal of confusion surrounding this issue. A standard philosophical strategy in the face of a situation of this kind is to draw various distinctions and in this way show that the confusion rests on divergent conceptions of what the foundations of mathematics ought to be. This is the strategy adopted in the present paper. It is divided into 5 (...) sections. We first show that already in the set theoretical framework, there are different dimensions to the expression foundations of. We then explore these dimensions more thoroughly. After a very short discussion of the links between these dimensions, we move to some of the arguments presented for and against category theory in the foundational landscape. We end up on a more speculative note by examining the relationships between category theory and set theory. (shrink)

In this paper I show that proofs by contradiction were a serious problem in seventeenth century mathematics and philosophy. Their status was put into question and positive mathematical developments emerged from such reflections. I analyse how mathematics, logic, and epistemology are intertwined in the issue at hand. The mathematical part describes Cavalieri's and Guldin's mathematical programmes of providing a development of parts of geometry free of proofs by contradiction. The logical part shows how the traditional Aristotelean doctrine that perfect demonstrations (...) are causal demonstrations influenced the reflection on proofs by contradiction. The main protagonist of this part is Wallis. Finally, I analyse some epistemological developments arising from the Cartesian tradition. In particular, I look at Arnauld's programme of providing an epistemologically motivated reformulation of Geometry free of proofs by contradiction. The conclusion explains in which sense these epistemological reflections can be compared with those informing contemporary intuitionism. (shrink)

A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...) to provide a natural foundation for partial functions in programming languages. Vis à vis (2), the question is raised whether the Beeson-Farmer-Feferman approach is adequate to the treatment of partial functions in all programming languages. Gumb and the author say No, and suggest a way of handling the refractory cases by means of positive free logic. Finally, Antonelli's solution of a problem associated with the Gumb-Lambert proposal is mentioned. (shrink)

Attempts to lay a foundation for the sciences based on modern mathematics are questioned. In particular, it is not clear that computer science should be based on set-theoretic mathematics. Set-theoretic mathematics has difficulties with its own foundations, making it reasonable to explore alternative foundations for the sciences. The role of computation within an alternative framework may prove to be of great potential in establishing a direction for the new field of computer science.Whitehead''s theory of reality is re-examined as a foundation (...) for the sciences. His theory does not simply attempt to add formal rigor to the sciences, but instead relies on the methods of the biological and social sciences to construct his world-view. Whitehead''s theory is a rich source of notions that are intended to explain every element of experience. It is a product of Whitehead''s earlier attempt to provide a mathematical foundation for the physical sciences and is still consistent with modern physics. (shrink)

We analyze the developments in mathematical rigor from the viewpoint of a Burgessian critique of nominalistic reconstructions. We apply such a critique to the reconstruction of infinitesimal analysis accomplished through the efforts of Cantor, Dedekind, and Weierstrass; to the reconstruction of Cauchy’s foundational work associated with the work of Boyer and Grabiner; and to Bishop’s constructivist reconstruction of classical analysis. We examine the effects of a nominalist disposition on historiography, teaching, and research.

The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications of the starting systems are possible due to the special rule dealing with identity and existence predicate. Cut elimination is (...) proved in a constructive way for sequent calculi adequate for all logics under consideration. (shrink)

To what extent can constructive mathematics based on intuitionistc logic recover the mathematics needed for spacetime physics? Certain aspects of this important question are examined, both technical and philosophical. On the technical side, order, connectivity, and extremization properties of the continuum are reviewed, and attention is called to certain striking results concerning causal structure in General Relativity Theory, in particular the singularity theorems of Hawking and Penrose. As they stand, these results appear to elude constructivization. On the philosophical side, it (...) is argued that any mentalist-based radical constructivism suffers from a kind of neo-Kantian apriorism. It would be at best a lucky accident if objective spacetime structure mirrored mentalist mathematics. the latter would seem implicitly committed to a Leibnizian relationist view of spacetime, but is it doubtful if implementation of such a view would overcome the objection. As a result, an anti-realist view of physics seems forced on the radical constructivist. (shrink)

Category theory and topos theory have been seen as providing a structuralist framework for mathematics autonomous vis-a-vis set theory. It is argued here that these theories require a background logic of relations and substantive assumptions addressing mathematical existence of categories themselves. We propose a synthesis of Bell's many-topoi view and modal-structuralism. Surprisingly, a combination of mereology and plural quantification suffices to describe hypothetical large domains, recovering the Grothendieck method of universes. Both topos theory and set theory can be carried out (...) relative to such domains; puzzles about ‘large categories’ and ‘proper classes’ are handled in a uniform way, by relativization, sustaining insights of Zermelo. (shrink)

The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...) subject matters ‘richer’ than arithmetic, such as set theory. The move to this new formal setting provides deflationists with better defence and brings a broader perspective to the debate. (shrink)

There are two different ways to introduce the notion of truthin constructive mathematics. The first one is to use a Tarskian definition of truth in aconstructive (meta)language. According to some authors, (Kreisel, van Dalen, Troelstra ... ),this definition is entirely similar to the Tarskian definition of classical truth (thesis A).The second one, due essentially to Heyting and Kolmogorov, and known as theBrouwer–Heyting–Kolmogorov interpretation, is to explain informally what it means fora mathematical proposition to be constructively proved. According to other authors (...) (Martin-Löfand Shapiro), this interpretation and the Tarskian definition of truth amount to thesame (thesis B). My aim in this paper is to show that thesis A is only reasonable, that thesis Bis false and to answer the following question: what is defined by the Tarskian definition ofconstructive truth? (shrink)

Ernest Nagel Lecture, Columbia University, Sept. 27, 2007.

elaboration of the last part of my Tarski Lecture, “Truth unbound”, UC Berkeley, 3 April 2006, and of the lecture, “A nicer formal theory of non-hierarchical truth”, Workshop on Mathematical Methods in Philosophy, Banff , 18-23 Feb. 2007.

Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.

Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms — first-order logic, type theory, and set theory — are usually only adequate for reasoning about partial functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein practice. This paper shows how the traditional approach to partial functions (...) can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann—Bernays—Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems. (shrink)

Scientific pluralism is an issue at the forefront of philosophy of science. This landmark work addresses the question, Can pluralism be advanced as a general, philosophical interpretation of science?

Constructive and intuitionistic Zermelo-Fraenkel set theories are axiomatic theories of sets in the style of Zermelo-Fraenkel set theory (ZF) which are based on intuitionistic logic. They were introduced in the 1970's and they represent a formal context within which to codify mathematics based on intuitionistic logic. They are formulated on the basis of the standard first order language of Zermelo-Fraenkel set theory and make no direct use of inherently constructive ideas. In working in constructive and intuitionistic ZF we can thus (...) to some extent rely on our familiarity with ZF and its heuristics. -/- Notwithstanding the similarities with classical set theory, the concepts of set defined by constructive and intuitionistic set theories differ considerably from that of the classical tradition; they also differ from each other. The techniques utilised to work within them, as well as to obtain metamathematical results about them, also diverge in some respects from the classical tradition because of their commitment to intuitionistic logic. In fact, as is common in intuitionistic settings, a plethora of semantic and proof-theoretic methods are available for the study of constructive and intuitionistic set theories. -/- The entry introduces the main features of Constructive and Intuitionistic ZF and offers links to the relevant bibliography. (shrink)

1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of course (...) to Alan Turing, famous for his explication of the notion of mechanical computation on discrete data such as the integers. The ‘Newton’ there has to do to with the well known numerical method due to Isaac Newton for approximating the zeros of continuous functions under suitable conditions that is taken to be a paradigm of scientific computing. Finally, the meaning of “Turing meets Newton” in the title of Blum’s article has another, more particular aspect: in connection with the problem of controlling errors in the numerical solution of linear equations and inversion of matrices,Turing (1948) defined a notion of condition for the relation of changes in the output of a computation due to small changes in the input that is analogous to Newton’s definition of the derivative. The thrust of Blum’s 2004 article was that the BSS model of computation on the reals is the appropriate foundation for scientific computing in general. By way of response, two years later another very interesting and equally readable article appeared in the Notices, this time by Mark Braverman and Stephen Cook (2006) entitled “Computing over the reals: Foundations for scientific computing,” in which the authors argued that the requisite foundation is provided by a quite different “bit computation” model, that is in fact prima facie incompatible with the BSS model. The bit computation model goes back to ideas due to Stefan Banach and Stanislaw Mazur in the latter part of the 1930s, but the first publication was not made until Mazur (1963).. (shrink)

1. Logic, determinism and free will. The determinism-free will debate is perhaps as old as philosophy itself and has been engaged in from a great variety of points of view including those of scientific, theological and logical character; my concern here is to limit attention to two arguments from logic. To begin with, there is an argument in support of determinism that dates back to Aristotle, if not farther. It rests on acceptance of the Law of Excluded Middle, according to (...) which every proposition is either true or false, no matter whether the proposition is about the past, present or future. In particular, the argument goes, whatever one does or does not do in the future is determined in the present by the truth or falsity of the corresponding proposition. Surely no such argument could really establish determinism, but one is hard pressed to explain where it goes wrong. One now classic dismantling of it has been given by Gilbert Ryle, in the chapter ‘What was to be’ of his fine book, Dilemmas (Ryle 1954). We leave it to the interested reader to pursue that and the subsequent literature. (shrink)

From 1931 until late in his life (at least 1970) Godel called for the pursuit of new axioms for mathematics to settle both undecided number-theoretical propositions (of the form obtained in his incompleteness results) and undecided set-theoretical propositions (in particular CH). As to the nature of these, Godel made a variety of suggestions, but most frequently he emphasized the route of introducing ever higher axioms of in nity. In particular, he speculated (in his 1946 Princeton remarks) that there might be (...) a uniform (though non-decidable) rationale for the choice of the latter. Despite the intense exploration of the \higher in nite" in the last 30-odd years, no single rationale of that character has emerged. Moreover, CH still remains undecided by such axioms, though they have been demonstrated to have many other interesting set-theoretical consequences. (shrink)

An interview with Charles McCarty by Piotr Urbańczyk concerning mathematical explanation.

A recognizable topological model construction shows that any consistent principles of classical set theory, including the validity of the law of the excluded third, together with a standard class theory, do not suffice to demonstrate the general validity of the law of the excluded third. This result calls into question the classical mathematician's ability to offer solid justifications for the logical principles he or she favors.

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

5.5. Every topos is linguistic: the equivalence theorem.