Recommended

CHOICE

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

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.
Les mer
A famous theorem from Gödel entails that if our thinking capacities do not go beyond what an electronic computer is capable of, then there are indeed absolutely unsolvable mathematical problems. Within this context, the contributions to this book critically examine positions about the scope and limits of human mathematical knowledge.
Les mer
ALGORITHM, CONSISTENCY AND EPISTEMIC RANDOMNESS; MIND AND MACHINES; ABSOLUTE UNDECIDABILITY
The contributions in this volume have been written by world leading experts in the field. Cutting edge research on scope and limits of mathematical knowledge. Extended introduction to key problems, arguments, and positions. Clear structure through the whole collection of articles.
Les mer
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.
Les mer
The contributions in this volume have been written by world leading experts in the field. Cutting edge research on scope and limits of mathematical knowledge. Extended introduction to key problems, arguments, and positions. Clear structure through the whole collection of articles.
Les mer

Produktdetaljer

ISBN
9780198759591
Publisert
2016
Utgiver
Oxford University Press
Vekt
594 gr
Høyde
239 mm
Bredde
174 mm
Dybde
23 mm
Aldersnivå
UP, 05
Språk
Product language
Engelsk
Format
Product format
Innbundet
Antall sider
288

Biografisk notat

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.