Teaching Gödel's incompleteness theorems

03/31/2023
by   Gilles Dowek, et al.
0

The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science departments, to graduate and to undergraduate students. Many textbooks now present these notions, in particular the incompleteness theorems. Having taught these notions for several decades, our community can now stand back and analyze the choices faced when designing such a course. In this note, we attempt to analyze the choices faced when teaching the incompleteness theorems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2022

Teaching Functional Programmers Logic and Metatheory

We present a novel approach for teaching logic and the metatheory of log...
research
04/01/2019

Categories with Families: Unityped, Simply Typed, and Dependently Typed

We show how the categorical logic of untyped, simply typed and dependent...
research
04/04/2018

Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic

Logic is a foundation for many modern areas of computer science. In arti...
research
01/03/2022

Automated Theorem Proving in the Classroom

We report on several scenarios of using automated theorem proving softwa...
research
07/23/2022

Challenges Faced by Teaching Assistants in Computer Science Education Across Europe

Teaching assistants (TAs) are heavily used in computer science courses a...
research
09/06/2019

Incompleteness Ex Machina

In this essay we'll prove Gödel's incompleteness theorems twice. First, ...
research
08/21/2019

Free Theorems Simply, via Dinaturality

Free theorems are a popular tool in reasoning about parametrically polym...

Please sign up or login with your details

Forgot password? Click here to reset