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)

Hao Wang was one of the few confidants of the great mathematician and logician Kurt Gödel. _A Logical Journey_ is a continuation of Wang's _Reflections on Gödel_ and also elaborates on discussions contained in _From Mathematics to Philosophy_. A decade in preparation, it contains important and unfamiliar insights into Gödel's views on a wide range of issues, from Platonism and the nature of logic, to minds and machines, the existence of God, and positivism and phenomenology. The impact of Gödel's theorem (...) on twentieth-century thought is on par with that of Einstein's theory of relativity, Heisenberg's uncertainty principle, or Keynesian economics. These previously unpublished intimate and informal conversations, however, bring to light and amplify Gödel's other major contributions to logic and philosophy. They reveal that there is much more in Gödel's philosophy of mathematics than is commonly believed, and more in his philosophy than his philosophy of mathematics. Wang writes that "it is even possible that his quite informal and loosely structured conversations with me, which I am freely using in this book, will turn out to be the fullest existing expression of the diverse components of his inadequately articulated general philosophy." The first two chapters are devoted to Gödel's life and mental development. In the chapters that follow, Wang illustrates the quest for overarching solutions and grand unifications of knowledge and action in Gödel's written speculations on God and an afterlife. He gives the background and a chronological summary of the conversations, considers Gödel's comments on philosophies and philosophers, and his attempt to demonstrate the superiority of the mind's power over brains and machines. Three chapters are tied together by what Wang perceives to be Gödel's governing ideal of philosophy: an exact theory in which mathematics and Newtonian physics serve as a model for philosophy or metaphysics. Finally, in an epilog Wang sketches his own approach to philosophy in contrast to his interpretation of Gödel's outlook. (shrink)

It is commonly agreed that the well-known Lucas-Penrose arguments and even Penrose's 'new argument' in [Penrose, R. (1994): Shadows of the Mind, Oxford University Press] are inconclusive. It is, perhaps, less clear exactly why at least the latter is inconclusive. This note continues the discussion in [Lindström, P. (2001): Penrose's new argument, J. Philos. Logic 30, 241-250; Shapiro, S.(2003): Mechanism, truth, and Penrose's new argument, J. Philos. Logic 32, 19-42] and elsewhere of this question.

It has been argued, by Penrose and others, that Gödel's proof of his first incompleteness theorem shows that human mathematics cannot be captured by a formal system F: the Gödel sentence G(F) of F can be proved by a (human) mathematician but is not provable in F. To this argment it has been objected that the mathematician can prove G(F) only if (s)he can prove that F is consistent, which is unlikely if F is complicated. Penrose has invented a new (...) argument intended to avoid this objection. In the paper I try to show that Penrose's new argument is inconclusive. (shrink)

The unfolding of schematic formal systems is a novel concept which was initiated in Feferman , Gödel ’96, Lecture Notes in Logic, Springer, Berlin, 1996, pp. 3–22). This paper is mainly concerned with the proof-theoretic analysis of various unfolding systems for non-finitist arithmetic . In particular, we examine two restricted unfoldings and , as well as a full unfolding, . The principal results then state: is equivalent to ; is equivalent to ; is equivalent to . Thus is proof-theoretically equivalent (...) to predicative analysis. (shrink)

Category Theory has developed rapidly. This book aims to present those ideas and methods which can now be effectively used by Mathe­ maticians working in a variety of other fields of Mathematical research. This occurs at several levels. On the first level, categories provide a convenient conceptual language, based on the notions of category, functor, natural transformation, contravariance, and functor category. These notions are presented, with appropriate examples, in Chapters I and II. Next comes the fundamental idea of an adjoint (...) pair of functors. This appears in many substantially equivalent forms: That of universal construction, that of direct and inverse limit, and that of pairs offunctors with a natural isomorphism between corresponding sets of arrows. All these forms, with their interrelations, are examined in Chapters III to V. The slogan is "Adjoint functors arise everywhere". Alternatively, the fundamental notion of category theory is that of a monoid -a set with a binary operation of multiplication which is associative and which has a unit; a category itself can be regarded as a sort of general­ ized monoid. Chapters VI and VII explore this notion and its generaliza­ tions. Its close connection to pairs of adjoint functors illuminates the ideas of universal algebra and culminates in Beck's theorem characterizing categories of algebras; on the other hand, categories with a monoidal structure lead inter alia to the study of more convenient categories of topological spaces. (shrink)

Winner of the Wolf Prize for his contribution to our understanding of the universe, Penrose takes on the question of whether artificial intelligence will ever ...

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