Martin Davis on Computability, Computational Logic, and Mathematical Foundations

Cham, Switzerland: Springer Verlag (2016)
  Copy   BIBTEX

Abstract

This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis’ work and set it in a contemporary context. They analyse, discuss and develop many of the ideas and concepts that Davis put forward, including such issues as contemporary satisfiability solvers, essential unification, quantum computing and generalisations of Hilbert’s tenth problem. The book starts out with a scientific autobiography by Davis, and ends with his responses to comments included in the contributions. In addition, it includes two previously unpublished original historical papers in which Davis and Putnam investigate the decidable and the undecidable side of Logic, as well as a full bibliography of Davis’ work. As a whole, this book shows how Davis’ scientific work lies at the intersection of computability, theoretical computer science, foundations of mathematics, and philosophy, and draws its unifying vision from his deep involvement in Logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

S. Barry Cooper, computability theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.

Analytics

Added to PP
2019-01-25

Downloads
16 (#909,581)

6 months
6 (#526,916)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Grundzüge der theoretischen logik.David Hilbert - 1928 - Berlin,: G. Springer. Edited by Wilhelm Ackermann.
Arithmetical problems and recursively enumerable predicates.Martin Davis - 1953 - Journal of Symbolic Logic 18 (1):33-41.
Existential Definability in Arithmetic.Julia Robinson - 1955 - Journal of Symbolic Logic 20 (2):182-183.

View all 8 references / Add more references