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.

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)

This comprehensive reference provides an exhaustive guide to current scholarship on the perennial problem of Free Will--perhaps the most hotly and voluminously debated of all philosophical problems. While reference is made throughout to the contributions of major thinkers of the past, the emphasis is on recent research. The essays, most of which are previously unpublished, combine the work of established scholars with younger thinkers who are beginning to make significant contributions. Taken as a whole, the Handbook provides an engaging and (...) accessible roadmap to the state of the art thinking on this enduring topic. (shrink)

Problem-solving software that is not-necessarily infallible is central to AI. Such software whose correctness and incorrectness properties are deducible by agents is an issue at the foundations of AI. The Comprehensibility Theorem, which appeared in a journal for specialists in formal mathematical logic, might provide a limitation concerning this issue and might be applicable to any agents, regardless of whether the agents are artificial or natural. The present article, aimed at researchers interested in the foundations of AI, addresses many questions (...) related to that theorem, including differences between it and results of Gödel and Turing that have sometimes played key roles in Minds and Machines articles. This study also suggests that—if one is willing to assume a thesis due to Donald Knuth—the Comprehensibility Theorem is the first mathematical theorem implying the impossibility of any AI agent or natural agent—including a not-necessarily infallible human agent—satisfying a rigorous and deductive interpretation of the self-comprehensibility challenge. Some have pointed out the difficulty of self-comprehensibility, even according to presumably a less rigorous interpretation. This includes Socrates, who considered it to be among the most important of intellectual tasks. Self-comprehensibility in some form might be essential for a kind of self-reflection useful for self-improvement that might enable some agents to increase their success. We use the methods of applied mathematics, rather than philosophy, although some topics considered could be of interest to philosophers. (shrink)

Good reasoning can lead to success; bad reasoning can lead to catastrophe. Yet, it's not obvious how we reason, and why we make mistakes. This new book by one of the pioneers of the field, Philip Johnson-Laird, looks at the mental processes that underlie our reasoning. It provides the most accessible account yet of the science of reasoning.

John Barrow is increasingly recognized as one of our most elegant and accomplished science writers, a brilliant commentator on cosmology, mathematics, and modern physics. Barrow now tackles the heady topic of impossibility, in perhaps his strongest book yet. Writing with grace and insight, Barrow argues convincingly that there are limits to human discovery, that there are things that are ultimately unknowable, undoable, or unreachable. He first examines the limits on scientific inquiry imposed by the deficiencies of the human mind: our (...) brain evolved to meet the demands of our immediate environment, Barrow notes, and much that lies outside this small circle may also lie outside our understanding. Barrow investigates practical impossibilities, such as those imposed by complexity, uncomputability, or the finiteness of time, space, and resources. Is the universe finite or infinite? Can information be transmitted faster than the speed of light? The book also examines the deeper theoretical restrictions on our ability to know, including Godel's theorem--which proved that there were things that could not be proved--and Arrow's Impossibility theorem about democratic voting systems. Finally, having explored the limits imposed on us from without, Barrow considers whether there are limits we should impose upon ourselves. For instance, if the secrets of the atom are to be found only by recreating extreme environments at great financial cost, just how much should we devote to that quest? Weaving together this intriguing tapestry, he illuminates some of the most profound questions of science, from the possibility of time travel to the very structure of the universe. (shrink)

First English translation of revolutionary paper that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.

Artificial Intelligence: A Modern Approach, 3e offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence. Number one in its field, this textbook is ideal for one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence. Dr. Peter Norvig, contributing Artificial Intelligence author and Professor Sebastian Thrun, a Pearson author are offering a free online course at Stanford University on artificial intelligence. According to an article in The New York Times, the course on artificial intelligence is (...) “one of three being offered experimentally by the Stanford computer science department to extend technology knowledge and skills beyond this elite campus to the entire world.” One of the other two courses, an introduction to database software, is being taught by Pearson author Dr. Jennifer Widom. Artificial Intelligence: A Modern Approach, 3e is available to purchase as an eText for your Kindle™, NOOK™, and the iPhone®/iPad®. (shrink)

This comprehensive overview ofmathematical logic is designedprimarily for advanced undergraduatesand graduate studentsof mathematics. The treatmentalso contains much of interest toadvanced students in computerscience and philosophy. Topics include propositional logic;first-order languages and logic; incompleteness, undecidability,and indefinability; recursive functions; computability;and Hilbert’s Tenth Problem.Reprint of the PWS Publishing Company, Boston, 1995edition.

This second edition of The Oxford Handbook of Free Will is intended to be a sourcebook and guide to current work on free will and related subjects.