Examples of possible theological influences upon the development of mathematics are indicated. The best known connection can be found in the realm of infinite sets treated by us as known or graspable, which constitutes a divine-like approach. Also the move to treat infinite processes as if they were one finished object that can be identified with its limits is routine in mathematicians, but refers to seemingly super-human power. For centuries this was seen as wrong and even today some philosophers, for (...) example Brian Rotman, talk critically about “theological mathematics”. Theological metaphors, like “God’s view”, are used even by contemporary mathematicians. While rarely appearing in official texts they are rather easily invoked in “the kitchen of mathematics”. There exist theories developing without the assumption of actual infinity the tools of classical mathematics needed for applications (For instance, Mycielski’s approach). Conclusion: mathematics could have developed in another way. Finally, several specific examples of historical situations are mentioned where, according to some authors, direct theological input into mathematics appeared: the possibility of the ritual genesis of arithmetic and geometry, the importance of the Indian religious background for the emergence of zero, the genesis of the theories of Cantor and Brouwer, the role of Name-worshipping for the research of the Moscow school of topology. Neither these examples nor the previous illustrations of theological metaphors provide a certain proof that religion or theology was directly influencing the development of mathematical ideas. They do suggest, however, common points and connections that merit further exploration. (shrink)

First published in 1971, Professor Putnam's essay concerns itself with the ontological problem in the philosophy of logic and mathematics - that is, the issue of whether the abstract entities spoken of in logic and mathematics really exist. He also deals with the question of whether or not reference to these abstract entities is really indispensible in logic and whether it is necessary in physical science in general.

Most scholars think of David Hilbert's program as the most demanding and ideologically motivated attempt to provide a foundation for mathematics, and because they see technical obstacles in the way of realizing the program's goals, they regard it as a failure. Against this view, Curtis Franks argues that Hilbert's deepest and most central insight was that mathematical techniques and practices do not need grounding in any philosophical principles. He weaves together an original historical account, philosophical analysis, and his own development (...) of the meta-mathematics of weak systems of arithmetic to show that the true philosophical significance of Hilbert's program is that it makes the autonomy of mathematics evident. The result is a vision of the early history of modern logic that highlights the rich interaction between its conceptual problems and technical development. (shrink)

In response to Bhupinder Singh Anand''s article CAN WE REALLY FALSIFY TRUTH BY DICTAT? in THE REASONER II, 1, January 2008,that denies the existence of nonstandard models of Peano Arithmetic, we prove from Compactness the existence of such models.

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin.One level is given by an intensional type theory, called Minimal type theory. This theory extends a previous version with collections.The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model.This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks (...) to the way the extensional level is linked to the intensional one which fulfills the “proofs-as-programs” paradigm and acts as a programming language. (shrink)

An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.

Hilbert developed his famous finitist point of view in several essays in the 1920s. In this paper, we discuss various extensions of it, with particular emphasis on those suggested by Hilbert and Bernays in Grundlagen der Mathematik (vol. I 1934, vol. II 1939). The paper is in three sections. The first deals with Hilbert's introduction of a restricted ? -rule in his 1931 paper ?Die Grundlegung der elementaren Zahlenlehre?. The main question we discuss here is whether the finitist (meta-)mathematician would (...) be entitled to accept this rule as a finitary rule of inference. In the second section, we assess the strength of finitist metamathematics in Hilbert and Bernays 1934. The third and final section is devoted to the second volume of Grundlagen der Mathematik. For preparatory reasons, we first discuss Gentzen's proposal of expanding the range of what can be admitted as finitary in his esssay ?Die Widerspruchsfreiheit der reinen Zahlentheorie? (1936). As to Hilbert and Bernays 1939, we end on a ?critical? note: however considerable the impact of this work may have been on subsequent developments in metamathematics, there can be no doubt that in it the ideals of Hilbert's original finitism have fallen victim to sheer proof-theoretic pragmatism. (shrink)

Abstract: According to the Veridicality Thesis, information requires truth. On this view, smoke carries information about there being a fire only if there is a fire, the proposition that the earth has two moons carries information about the earth having two moons only if the earth has two moons, and so on. We reject this Veridicality Thesis. We argue that the main notions of information used in cognitive science and computer science allow A to have information about the obtaining of (...) p even when p is false. (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 ...

The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...

8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.

"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)

The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability theory, and (...) model theory, the text also contains numerous carefully graded exercises and is ideal for a first or refresher course. (shrink)

Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.

Platonism is the most pervasive philosophy of mathematics. Indeed, it can be argued that an inarticulate, half-conscious Platonism is nearly universal among mathematicians. The basic idea is that mathematical entities exist outside space and time, outside thought and matter, in an abstract realm. In the more eloquent words of Edward Everett, a distinguished nineteenth-century American scholar, "in pure mathematics we contemplate absolute truths which existed in the divine mind before the morning stars sang together, and which will continue to exist (...) there when the last of their radiant host shall have fallen from heaven." In What is Mathematics, Really?, renowned mathematician Rueben Hersh takes these eloquent words and this pervasive philosophy to task, in a subversive attack on traditional philosophies of mathematics, most notably, Platonism and formalism. Virtually all philosophers of mathematics treat it as isolated, timeless, ahistorical, inhuman. Hersh argues the contrary, that mathematics must be understood as a human activity, a social phenomenon, part of human culture, historically evolved, and intelligible only in a social context. Mathematical objects are created by humans, not arbitrarily, but from activity with existing mathematical objects, and from the needs of science and daily life. Hersh pulls the screen back to reveal mathematics as seen by professionals, debunking many mathematical myths, and demonstrating how the "humanist" idea of the nature of mathematics more closely resembles how mathematicians actually work. At the heart of the book is a fascinating historical account of the mainstream of philosophy--ranging from Pythagoras, Plato, Descartes, Spinoza, and Kant, to Bertrand Russell, David Hilbert, Rudolph Carnap, and Willard V.O. Quine--followed by the mavericks who saw mathematics as a human artifact, including Aristotle, Locke, Hume, Mill, Peirce, Dewey, and Lakatos. In his epilogue, Hersh reveals that this is no mere armchair debate, of little consequence to the outside world. He contends that Platonism and elitism fit well together, that Platonism in fact is used to justify the claim that "some people just can't learn math." The humanist philosophy, on the other hand, links mathematics with geople, with society, and with history. It fits with liberal anti-elitism and its historical striving for universal literacy, universal higher education, and universal access to knowledge and culture. Thus Hersh's argument has educational and political ramifications. Written by the co-author of The Mathematical Experience, which won the American Book Award in 1983, this volume reflects an insider's view of mathematical life, based on twenty years of doing research on advanced mathematical problems, thirty-five years of teaching graduates and undergraduates, and many long hours of listening, talking to, and reading philosophers. A clearly written and highly iconoclastic book, it is sure to be hotly debated by anyone with a passionate interest in mathematics or the philosophy of science. (shrink)

This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.

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 proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could be found only by transcending the axioms (...) and proof processes of that formal system. Gentzen's proof succeeds by utilisingtransfinite inductionto prove that certain sequences of reduction processes, enumerated by ordinals less than ε (the first ordinal to satisfy ε = ὡ) are finite. Were it possible to provethe restricted ordinal theorem, that a descending sequence of ordinals, less thanε, is finite, in Gentzen's “reine Zahlentheorie,” then it would be possible to determine a contradiction in that number system. In his paper, Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument. There is also a method of reducing transfinite induction, for ordinals less than ε, to a number-theoretic principle given by Hilbert and Bernays, and a similar method by Ackermann. None of these proofs of transfinite induction isfinitist. (shrink)

How can we explain the strange behavior of quantum and relativistic entities? Why do they behave in ways that defy our intuition about how physical entities should behave, considering our ordinary experience of the world around us? In this article, we address these questions by showing that the comportment of quantum and relativistic entities is not that strange after all, if we only consider what their nature might possibly be: not an objectual one, but a conceptual one. This not in (...) the sense that quantum and relativistic entities would be human concepts, but in the sense that they would share with the latter a same conceptual nature, similarly to how electromagnetic and sound waves, although very different entities, can share a same undulatory nature. When this hypothesis is adopted, i.e., when a conceptuality interpretation about the deep nature of physical entities is taken seriously, many of the interpretational difficulties disappear and our physical world is back making sense, though our view of it becomes radically different from what our classical prejudice made us believe in the first place. (shrink)

We assess the celebration of the 1st World Logic Day which recently took place all over the world. We then answer the question Why a World Logic Day? in two steps. First we explain why promoting logic, emphasizing its fundamental importance and its relations with many other fields. Secondly we examine the sense of a one-day celebration: how this can help reinforcing logic day-to-day and why logic deserves it. We make a comparison with other existing one-day celebrations. We end by (...) presenting and commenting the logo of the World Logic Day. (shrink)

How can we explain the strange behavior of quantum and relativistic entities? Why do they behave in ways that defy our intuition about how physical entities should behave, considering our ordinary experience of the world around us? In this article, we address these questions by showing that the comportment of quantum and relativistic entities is not that strange after all, if we only consider what their nature might possibly be: not an objectual one, but a conceptual one. This not in (...) the sense that quantum and relativistic entities would be human concepts, but in the sense that they would share with the latter a same conceptual nature, similarly to how electromagnetic and sound waves, although very different entities, can share a same undulatory nature. When this hypothesis is adopted, i.e., when a conceptuality interpretation about the deep nature of physical entities is taken seriously, many of the interpretational difficulties disappear and our physical world is back making sense, though our view of it becomes radically different from what our classical prejudice made us believe in the first place. (shrink)

A look at Wittgenstein's comments on the incompleteness theorem with an inter-pretation that is consistent with what Gödel proved.

Gödei's Theorem seems to me to prove that Mechanism is false, that is, that minds cannot be explained as machines. So also has it seemed to many other people: almost every mathematical logician I have put the matter to has confessed to similar thoughts, but has felt reluctant to commit himself definitely until he could see the whole argument set out, with all objections fully stated and properly met. This I attempt to do.

I defend Putnam’s modal structuralist view of mathematics but reject his claims that Wittgenstein’s remarks on Dedekind, Cantor, and set theory are verificationist. Putnam’s “realistic realism” showcases the plasticity of our “fitting” words to the world. The applications of this—in philosophy of language, mind, logic, and philosophy of computation—are robust. I defend Wittgenstein’s nonextensionalist understanding of the real numbers, showing how it fits Putnam’s view. Nonextensionalism and extensionalism about the real numbers are mathematically, philosophically, and logically robust, but the two (...) perspectives are often confused with one another. I separate them, using Turing’s work as an example. (shrink)

Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...) verifiably. We consider a constructive interpretation of classical, Tarskian, truth, and of Goedel's reasoning, under which any formal system of Peano Arithmetic---classically accepted as the foundation of all our mathematical Languages---is verifiably complete in the above sense. We show how some paradoxical concepts of Quantum mechanics can, then, be expressed, and interpreted, naturally under a constructive definition of mathematical truth. (shrink)