From Hilbert’s program to a logic tool box

Abstract

Abstract. In this paper I discuss what, according to my long experience, every computer scientists should know from logic. We concentrate on issues of modeling, interpretability and levels of abstraction. We discuss what the minimal toolbox of logic tools should look like for a computer scientist who is involved in designing and analyzing reliable systems. We shall conclude that many classical topics dear to logicians are less important than usually presented, and that less known ideas from logic may be more useful for the working computer scientist.For Witek Marek, first mentor, then colleague and true friend, on the occasion of his 65th birthday.

Teaching Logic for Computer Science: Are We Teaching the Wrong Narrative?

“…I lectured about it also at ETH Zurich and the Technical University in Vienna. A journal version appeared as [15].…”

Gödel Mathematics Versus Hilbert Mathematics. II Logicism and Hilbert Mathematics, the Identification of Logic and Set Theory, and Gödel’s 'Completeness Paper' (1930)

“…One can compare this with the link suggested byOleinik (1994): the "connection of the classical and quantum mechanical completeness of a potential at infinity on complete Riemannian manifolds". 67Makowsky (2008) discusses "logic for a computer scientist" in the context of Hilbert's program. Lambda calculus suggests its own way for relating logic to extensionality(Intrigila, Statman 2005;Hindley, Longo 1980).…”