=Paper=
{{Paper
|id=Vol-1645/inv4
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-1645/inv4.pdf
|volume=Vol-1645
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-1645/inv4.pdf</pdf>
<pre>
Martin Davis on Computability, Computational
    Logic, and Mathematical Foundations

                     Eugenio Omodeo1 Alberto Policriti2
                 1
                  Dipartimento di Matematica e Geoscienze,
                      Università degli Studi di Trieste
                2
                  Dipartimento di Matematica e Informatica,
                      Università degli Studi di Udine



   Abstract. Davis’s multi-faceted scientific activity lies at the barycentre
   of computability, theoretical computer science, foundations of mathemat-
   ics, philosophy, and draws its unitary vision from his deep involvement in
   Logic. He has been a trailblazer of the field today known as automated
   reasoning’: already in the 1950s, he and the distinguished philosopher
   Hilary Putnam addressed algorithmically the satisfiability problem for
   formulae in conjunctive normal form. Martin also cultivated, for a long
   time, a keen interest in the history and philosophy of computing: in
   1965 he collected an anthology on The Undecidable, later on he wrote
   landmark essays on Church, Gödel, Post, and Turing. Martin Davis and
   his publications have exerted a wide influence. This book testifies to
   this influence by focusing on scientific achievements in which he was
   involved in the first person and on further achievements, studies, and
   reflections in which work and vision consonant with his have played
   a role. The editors have collected testimonies of Davis’s contributions
   to computability, computational logic, and mathematical foundations.
   The contributions in this volume touch most of the aspects of Davis’s
   work as seen through the eyes of researchers active in the respective ar-
   eas. Together, they provide an accurate historical recollection of Davis’s
   role in advancing our understanding of the connections between logic,
   computing, and unsolvability. Some contributions are projected into the
   future, and discuss issues such as contemporary satisfiability solvers, es-
   sential unification, quantum computing, and generalizations of Hilbert’s
   tenth problem. The book is enriched by the inclusion of two historical
   paperswhich had remained unpublished so farwhere Davis and Putnam
   investigate the decidable and the undecidable side of Logic.

</pre>