Gödel's Disjunction: The scope and limits of mathematical knowledge

Author:   Leon Horsten (Professor of Philosophy, Professor of Philosophy, University of Bristol) ,  Philip Welch (Professor of Mathematical Logic, Professor of Mathematical Logic, University of Bristol)
Publisher:   Oxford University Press
ISBN:  

9780198759591


Pages:   288
Publication Date:   11 August 2016
Format:   Hardback
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Our Price $271.95 Quantity:  
Add to Cart

Share |

Gödel's Disjunction: The scope and limits of mathematical knowledge


Add your own review!

Overview

The logician Kurt Gödel in 1951 established a disjunctive thesis about the scope and limits of mathematical knowledge: either the mathematical mind is not equivalent to a Turing machine (i.e., a computer), or there are absolutely undecidable mathematical problems. In the second half of the twentieth century, attempts have been made to arrive at a stronger conclusion. In particular, arguments have been produced by the philosopher J.R. Lucas and by the physicist and mathematician Roger Penrose that intend to show that the mathematical mind is more powerful than any computer. These arguments, and counterarguments to them, have not convinced the logical and philosophical community. The reason for this is an insufficiency if rigour in the debate. The contributions in this volume move the debate forward by formulating rigorous frameworks and formally spelling out and evaluating arguments that bear on Gödel's disjunction in these frameworks. The contributions in this volume have been written by world leading experts in the field.

Full Product Details

Author:   Leon Horsten (Professor of Philosophy, Professor of Philosophy, University of Bristol) ,  Philip Welch (Professor of Mathematical Logic, Professor of Mathematical Logic, University of Bristol)
Publisher:   Oxford University Press
Imprint:   Oxford University Press
Dimensions:   Width: 17.40cm , Height: 2.30cm , Length: 23.90cm
Weight:   0.594kg
ISBN:  

9780198759591


ISBN 10:   0198759592
Pages:   288
Publication Date:   11 August 2016
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Table of Contents

Algorithm, consistency and epistemic randomness 1: Dean: ALGORITHMS AND THE MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2: Visser: THE SECOND INCOMPLETENESS THEOREM REFLECTIONS AND RUMINATIONS 3: Moschovakis: ITERATED DEFINABILITY, LAWLESS SEQUENCES AND BROUWER'S CONTINUUM 4: Achourioti: A SEMANTICS FOR IN PRINCIPLE PROVABILITY Mind and Machines 5: Carlson: Collapsing Knowledge and Epistemic Church's Thesis 6: Koellner: G odel's Disjunction 7: Shapiro: Idealization, mechanism, and knowability Absolute Undecidability 8: Leach-Krouse: PROVABILITY, MECHANISM AND THE DIAGONAL PROBLEM 9: Williamson: Absolute Provability and Safe Knowledge of Axioms 10: Antonutti, Horsten: Epistemic Church's Thesis and Absolute Undecidability

Reviews

An introduction by the editors offers an accessible entry point to readers with a basic background in mathematical logic. Many of the papers are clearly aimed at experts, but their introductory sections are generally written for a broader audience. ... The editors do a particularly good job of establishing context and background, as well as summarizing the contributions of the individual papers. Bill Satzer, MAA Reviews


Author Information

Leon Horsten is a philosophical logician and philosopher of mathematics, working at the University of Bristol since 2007. His research is concentrated chiefly on bringing formal methods to bear on philosophical problems in the philosophy of science, the philosophy of mathematics, the philosophy of language, epistemology and metaphysics. Formal methods are meant to include not only logical methods, but also methods from other areas of mathematics and computer science (graph theory, probability theory, complexity theory, ...). Philip Welch is a set theorist and mathematical logician, working in Bristol since 1986. For the period 1997-2000 he was at Kobe University Graduate School setting up a research group in Set Theory. He is the author of some 75 papers in set theory, logic, theories of truth, and transfinite models of computation. He is a subject Co-editor for the Stanford Encyclopaedia of Philosophy for philosophy of mathematics, and is an Editor for set theory of the Journal of Symbolic Logic. His doctoral `grandfather' is Alan Turing, his supervisor at Oxford (1975-78) Robin Gandy, being Turing's only PhD student.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List