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)

We now know of a number of ways of developing real analysis on a basis of abstraction principles and second-order logic. One, outlined by Shapiro in his contribution to this volume, mimics Dedekind in identifying the reals with cuts in the series of rationals under their natural order. The result is an essentially structuralist conception of the reals. An earlier approach, developed by Hale in his "Reals byion" program differs by placing additional emphasis upon what I here term Frege's Constraint, (...) that a satisfactory foundation for any branch of mathematics should somehow so explain its basic concepts that their applications are immediate. This paper is concerned with the meaning of and motivation for this constraint. Structuralism has to represent the application of a mathematical theory as always posterior to the understanding of it, turning upon the appreciation of structural affinities between the structure it concerns and a domain to which it is to be applied. There is, therefore, a case that Frege's Constraint has bite whenever there is a standing body of informal mathematical knowledge grounded in direct reflection upon sample, or schematic, applications of the concepts of the theory in question. It is argued that this condition is satisfied by simple arithmetic and geometry, but that in view of the gap between its basic concepts (of continuity and of the nature of the distinctions among the individual reals) and their empirical applications, it is doubtful that Frege's Constraint should be imposed on a neo-Fregean construction of analysis. (shrink)

Turing’s analysis of computability has recently been challenged; it is claimed that it is circular to analyse the intuitive concept of numerical computability in terms of the Turing machine. This claim threatens the view, canonical in mathematics and cognitive science, that the concept of a systematic procedure or algorithm is to be explicated by reference to the capacities of Turing machines. We defend Turing’s analysis against the challenge of ‘deviant encodings’.Keywords: Systematic procedure; Turing machine; Church–Turing thesis; Deviant encoding; Acceptable encoding; (...) Turing’s analysis of computability; Turing’s Notational Thesis. (shrink)

Available for the first time in 20 years, here is the Rudolf Carnap's famous principle of tolerance by which everyone is free to mix and match the rules of ...

This is identical with the first edition (see 21: 2716) except for the addition of a Supplement containing 5 previously published articles and the bringing of the bibliography (now 73 items) up to date. The 5 added articles present clarifications or modifications of views expressed in the first edition. (PsycINFO Database Record (c) 2009 APA, all rights reserved).

APA PsycNET abstract: This is the first volume of a two-volume work on Probability and Induction. Because the writer holds that probability logic is identical with inductive logic, this work is devoted to philosophical problems concerning the nature of probability and inductive reasoning. The author rejects a statistical frequency basis for probability in favor of a logical relation between two statements or propositions. Probability "is the degree of confirmation of a hypothesis (or conclusion) on the basis of some given evidence (...) (or premises)." Furthermore, all principles and theorems of inductive logic are analytic, and the entire system is to be constructed by means of symbolic logic and semantic methods. This means that the author confines himself to the formalistic procedures of word and symbol systems. The resulting sentence or language structures are presumed to separate off logic from all subjectivist or psychological elements. Despite the abstractionism, the claim is made that if an inductive probability system of logic can be constructed it will have its practical application in mathematical statistics, and in various sciences. 16-page bibliography. (PsycINFO Database Record (c) 2016 APA, all rights reserved). (shrink)

Clear, comprehensive, intermediate introduction to logical languages, applications of symbolic logic to physics, mathematics, biology.

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. (shrink)

This volume presents an historical and philosophical revisiting of the foundational character of Turing's conceptual contributions and assesses the impact of the work of Alan Turing on the history and philosophy of science. Written by experts from a variety of disciplines, the book draws out the continuing significance of Turing's work. The centennial of Turing's birth in 2012 led to the highly celebrated "Alan Turing Year", which stimulated a world-wide cooperative, interdisciplinary revisiting of his life and work. Turing is widely (...) regarded as one of the most important scientists of the twentieth century: He is the father of artificial intelligence, resolver of Hilbert's famous Entscheidungsproblem, and a code breaker who helped solve the Enigma code. His work revolutionized the very architecture of science by way of the results he obtained in logic, probability and recursion theory, morphogenesis, the foundations of cognitive psychology, mathematics, and cryptography. Many of Turing's breakthroughs were stimulated by his deep reflections on fundamental philosophical issues. Hence it is fitting that there be a volume dedicated to the philosophical impact of his work. One important strand of Turing's work is his analysis of the concept of computability, which has unquestionably come to play a central conceptual role in nearly every branch of knowledge and engineering. (shrink)

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

"This book is valuable as expounding in full a theory of meaning that has its roots in the work of Frege and has been of the widest influence.

Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

First published in 1974. Despite the tendency of contemporary analytic philosophy to put logic and mathematics at a central position, the author argues it failed to appreciate or account for their rich content. Through discussions of such mathematical concepts as number, the continuum, set, proof and mechanical procedure, the author provides an introduction to the philosophy of mathematics and an internal criticism of the then current academic philosophy. The material presented is also an illustration of a new, more general method (...) of approach called substantial factualism which the author asserts allows for the development of a more comprehensive philosophical position by not trivialising or distorting substantial facts of human knowledge. (shrink)

First published in 1974. Despite the tendency of contemporary analytic philosophy to put logic and mathematics at a central position, the author argues it failed to appreciate or account for their rich content. Through discussions of such mathematical concepts as number, the continuum, set, proof and mechanical procedure, the author provides an introduction to the philosophy of mathematics and an internal criticism of the then current academic philosophy. The material presented is also an illustration of a new, more general method (...) of approach called substantial factualism which the author asserts allows for the development of a more comprehensive philosophical position by not trivialising or distorting substantial facts of human knowledge. (shrink)

We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...) historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory.". (shrink)

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...) -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity. (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)

Many philosophers contend that Turing’s work provides a conceptual analysis of numerical computability. In (Rescorla, 2007), I dissented. I argued that the problem of deviant notations stymies existing attempts at conceptual analysis. Copeland and Proudfoot respond to my critique. I argue that their putative solution does not succeed. We are still awaiting a genuine conceptual analysis.

Explication is the conceptual cornerstone of Carnap’s approach to the methodology of scientific analysis. From a philosophical point of view, it gives rise to a number of questions that need to be addressed, but which do not seem to have been fully addressed by Carnap himself. This paper reconsiders Carnapian explication by comparing it to a different approach: the ‘formalisms as cognitive tools’ conception. The comparison allows us to discuss a number of aspects of the Carnapian methodology, as well as (...) issues pertaining to formalization in general. We start by introducing Carnap’s conception of explication, arguing that there is a tension between his proposed criteria of fruitfulness and similarity; we also argue that his further desideratum of exactness is less crucial than might appear at first. We then bring in the general idea of formalisms as cognitive tools, mainly by discussing the reliability of so-called statistical prediction rules, i.e. simple algorithms used to make predictions across a range of areas. SPRs allow for a concrete instantiation of Carnap’s fruitfulness desideratum, which is arguably the most important desideratum for him. Finally, we elaborate on what we call the ‘paradox of adequate formalization’, which for the Carnapian corresponds to the tension between similarity and fruitfulness. We conclude by noting that formalization is an inherently paradoxical enterprise in general, but one worth engaging in given the ‘cognitive boost’ it affords as a tool for discovery. (shrink)

This paper argues that Carnap both did not view and should not have viewed Frege's project in the foundations of mathematics as misguided metaphysics. The reason for this is that Frege's project was to give an explication of number in a very Carnapian sense — something that was not lost on Carnap. Furthermore, Frege gives pragmatic justification for the basic features of his system, especially where there are ontological considerations. It will be argued that even on the question of the (...) independent existence of abstract objects, Frege and Carnap held remarkably similar views. I close with a discussion of why, despite all this, Frege would not accept the principle of tolerance. (shrink)

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...) coverage of introductory material such as sets. Increased flexibility of the text, allowing instructors more choice in how they use the textbook in courses. Reduced mathematical rigour to fit the needs of undergraduate students. (shrink)

Written for any readers interested in better harnessing philosophy’s real value, this book covers a broad range of fundamental philosophical problems and certain intellectual techniques for addressing those problems. In Introducing Philosophy: God, Mind, World, and Logic , Neil Tennant helps any student in pursuit of a ‘big picture’ to think independently, question received dogma, and analyse problems incisively. It also connects philosophy to other areas of study at the university, enabling all students to employ the concepts and techniques of (...) this millennia-old discipline throughout their college careers – and beyond. KEY FEATURES AND BENEFITS: -- Investigates the philosophy of various subjects , helping students contextualize philosophy and view it as an interdisciplinary pursuit; also helps students with majors outside of philosophy to see the relationship between philosophy and their own focused academic pursuits -- Author comes from a distinguished background in Logic and Philosophy of Language, which gives the book a level of rigor, balance, and analytic focus sometimes missing from primers to philosophy -- Introduces students to various important philosophical distinctions providing skills that are important for undergraduates to develop in order to inform their study at higher levels. They are essential for further work in philosophy but they are also very beneficial for students pursuing most other disciplines -- Is much more methodologically comprehensive than competing introductions, giving the student the ability to address a wide range of philosophical problems – and not just the ones reviewed in the book -- Offers a companion website with links to apt primary sources, organized chapter-by-chapter, making unnecessary a separate Reader/Anthology of primary sources – thus providing students with all reading material necessary for the course -- Provides five to ten discussion questions for each chapter, helping instructors and students better interact with the ideas and concepts in the text. (shrink)

Carnap's ideal of explication has become a key concept in analytic philosophy and the basis of a method of analysis which may be considered as an alternative to various forms of naturalism, including Quine's conception of a naturalized epistemology. More recently, new light has been shed on this aspect of the classical Carnap-Quine debate by contemporary philosophers. Whereas Michael Friedman articulated a notion of relativized a priori which owes much to Carnap's internal/external distinction, André Carus attempted to restate Carnap's ideal (...) of explication in a way that bridges the gap between conceptual engineering and naturalism. On the other hand, Mark Wilson argued that concepts develop in unpredictable ways and cannot be planned in the way classical analytic philosophy has assumed from Frege and Russell onwards. This book consists of a series of defences as well as critiques of Carnap's programme, setting it in its historical context, discussing specific cases of explications, and enriching the on-going debate on conceptual engineering and naturalism in analytic philosophy.Carnap's ideal of explication has become a key concept in analytic philosophy and the basis of a method of analysis which may be considered as an alternative to various forms of naturalism, including Quine's conception of a naturalized epistemology. More recently, new light has been shed on this aspect of the classical Carnap-Quine debate by contemporary philosophers. Whereas Michael Friedman articulated a notion of relativized a priori which owes much to Carnap's internal/external distinction, André Carus attempted to restate Carnap's ideal of explication in a way that bridges the gap between conceptual engineering and naturalism. On the other hand, Mark Wilson argued that concepts develop in unpredictable ways and cannot be planned in the way classical analytic philosophy has assumed from Frege and Russell onwards. This book consists of a series of defences as well as critiques of Carnap's programme, setting it in its historical context, discussing specific cases of explications, and enriching the on-going debate on conceptual engineering and naturalism in analytic philosophy. (shrink)

This is an introduction to set theory and logic that starts completely from scratch. The text is accompanied by many methodological remarks and explanations.

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...) Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)