Famously, Michael Dummett argues that considerations concerning the role of language in communication lead to the rejection of classical logic in favor of intuitionistic logic. Potentially, this results in massive revisions of established mathematics. Recently, Neil Tennant (“The law of excluded middle is synthetic a priori, if valid”, Philosophical Topics 24 (1996), 205-229) suggested that a Dummettian anti-realist can accept the law of excluded middle as a synthetic, a priori principle grounded on a metaphysical principle of determinacy. This article shows (...) that the for the anti-realist, the law of excluded middle entails that humans have wildly implausible abilities. The proposed synthesis between anti-realism and classical mathematics thus fails. (shrink)

In this paper, I use the cases of intuitionistic arithmetic with Church’s thesis, intuitionistic analysis, and smooth infinitesimal analysis to argue for a sort of pluralism or relativism about logic. The thesis is that logic is relative to a structure. There are classical structures, intuitionistic structures, and (possibly) paraconsistent structures. Each such structure is a legitimate branch of mathematics, and there does not seem to be an interesting logic that is common to all of them. One main theme of my (...) ante rem structuralism is that any coherent axiomatization describes a structure, or a class of structures. If one weakens the logic, then more axiomatizations become coherent. (shrink)

We study the lattice of local operators in Hylandʼs Effective Topos. We show that this lattice is a free completion under internal sups indexed by the natural numbers object, generated by what we call basic local operators.We produce many new local operators and we employ a new concept, sight, in order to analyze these.We show that a local operator identified by A.M. Pitts in his thesis, gives a subtopos with classical arithmetic.

Recently, the second author, Briseid, and Safarik introduced nonstandard Dialectica, a functional interpretation capable of eliminating instances of familiar principles of nonstandard arithmetic—including overspill, underspill, and generalizations to higher types—from proofs. We show that the properties of this interpretation are mirrored by first-order logic in a constructive sheaf model of nonstandard arithmetic due to Moerdijk, later developed by Palmgren, and draw some new connections between nonstandard principles and principles that are rejected by strict constructivism. Furthermore, we introduce a variant of (...) the Diller–Nahm interpretation with two different kinds of quantifiers, similar to Hernest’s light Dialectica interpretation, and show that one can obtain nonstandard Dialectica by weakening the computational content of the existential quantifiers—a process called herbrandization. We also define a constructive sheaf model mirroring this new functional interpretation, and show that the process of herbrandization has a clear meaning in terms of these sheaf models. (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)

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.

In this paper I argue that whether or not a computer can be built that passes the Turing test is a central question in the philosophy of mind. Then I show that the possibility of building such a computer depends on open questions in the philosophy of computer science: the physical Church-Turing thesis and the extended Church-Turing thesis. I use the link between the issues identified in philosophy of mind and philosophy of computer science to respond to a prominent argument (...) against the possibility of building a machine that passes the Turing test. Finally, I respond to objections against the proposed link between questions in the philosophy of mind and philosophy of computer science. (shrink)