GODEL'S DISJUNCTION C

Erscheinungsjahr 2016
ISBN: 978-0-19-875959-1
Verlag: ACADEMIC

Buch, Englisch, 288 Seiten, Print PDF, Format (B × H): 161 mm x 240 mm, Gewicht: 599 g

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.

Autoren/Hrsg.

Horsten, Welch

Horsten, Leon

Welch, Philip

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Philosophie der Mathematik
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Geisteswissenschaften Philosophie Philosophie der Mathematik, Philosophie der Physik

Inhaltsverzeichnis

- 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

Über Autor(innen)

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.