Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...) of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

In this paper I will argue that Tait’s axiomatic conception of mathematics implies that it is in principle impossible to be justified in believing a mathematical statement without being justified in believing that statement to be provable. I will then show that there are possible courses of experience which would justify acceptance of a mathematical statement without justifying belief that this statement is provable.

ABNER SHIMONY of the Paradox A PHILOSOPHICAL PUPPET PLAY Dramatis personae: Zeno , Pupil, Lion Scene: The school of Zeno at Elea. Pup. Master! ...

This is a book that no one but Weyl could have written--and, indeed, no one has written anything quite like it since.

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)

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify (...) many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today. (shrink)

This book, Foundations of Constructive Analysis, founded the field of constructive analysis because it proved most of the important theorems in real analysis by constructive methods. The author, Errett Albert Bishop, born July 10, 1928, was an American mathematician known for his work on analysis. In the later part of his life Bishop was seen as the leading mathematician in the area of Constructive mathematics. From 1965 until his death, he was professor at the University of California at San Diego.

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of computability.

The standard theory of computation excludes computations whose completion requires an infinite number of steps. Malament-Hogarth spacetimes admit observers whose pasts contain entire future-directed, timelike half-curves of infinite proper length. We investigate the physical properties of these spacetimes and ask whether they and other spacetimes allow the observer to know the outcome of a computation with infinitely many steps.

Charles Parsons examines the notion of object, with the aim to navigate between nominalism, denying that distinctively mathematical objects exist, and forms of Platonism that postulate a transcendent realm of such objects. He introduces the central mathematical notion of structure and defends a version of the structuralist view of mathematical objects, according to which their existence is relative to a structure and they have no more of a 'nature' than that confers on them. Parsons also analyzes the concept of intuition (...) and presents a conception of it distantly inspired by that of Kant, which describes a basic kind of access to abstract objects and an element of a first conception of the infinite. (shrink)

This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics, for example Brouwer's proof of the Bar Theorem, valuation systems, and the completeness of intuitionistic first-order logic, have been completely revised.

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)