[Alta-Logic] W25 course on Gödel's incompleteness theorems

[Richard Zach]

PPS class meets TR 12:30–13:45 in
541 Social Science
________________________________
From: alta-logic-l <alta-logic-l-bounces at mailman.ucalgary.ca> on behalf of Richard Zach <rzach at ucalgary.ca>
Sent: Friday, December 13, 2024 11:27:45 AM
To: alta-logic-l at mailman.ucalgary.ca <alta-logic-l at mailman.ucalgary.ca>
Subject: Re: [Alta-Logic] W25 course on Gödel's incompleteness theorems

PS the (free) textbook is this:
https://ic.openlogicproject.org/
________________________________
From: alta-logic-l <alta-logic-l-bounces at mailman.ucalgary.ca> on behalf of Richard Zach <rzach at ucalgary.ca>
Sent: December 13, 2024 10:49
To: alta-logic-l at mailman.ucalgary.ca <alta-logic-l at mailman.ucalgary.ca>
Subject: [Alta-Logic] W25 course on Gödel's incompleteness theorems

Do you know a MTST or CPSC student in need of an Arts option? I'm teaching Gödel's incompleteness theorems next term (PHIL 479 Logic III). There's also a grad section (PHIL 679.1). PHIL 379 is a prereq but I would waive that for an eager and smart undergrad with only Logic I (PHIL 279). Note that prereq waivers have to be requested using an online form and before January 1: https://arts.ucalgary.ca/current-students/undergraduate/academic-advising-and-degree-planning/undergraduate-forms

Description:

This course will focus on two famous theorems of symbolic logic due to Kurt
Gödel: The Incompleteness Theorems. The first of these states, roughly,
that every formal mathematical theory, provided it is sufficiently expressive
and free from contradictions, is incomplete in the sense that there are always
statements (in fact, true statements) in the language of the theory which the
theory can’t prove.

In order to prove the Incompleteness Theorem, we will study the expres-
sive power of formal languages and axiomatic theories—this is an important
and exciting area in itself. This investigation will lead us naturally to com-
putability. We’ll approach computability not via Turing machines, but via
the notion of a recursive function.

Additional topics may include a more in-depth study of computability
theory and second-order logic.



Richard Zach<https://richardzach.org/>, Professor of Philosophy
Graduate Program Director
Book time to meet with me<https://outlook.office.com/bookwithme/user/88799128dc9e42f996f147dd2db846e6@ucalgary.ca?anonymous&ep=signature>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.ucalgary.ca/pipermail/alta-logic-l/attachments/20241215/e750c570/attachment.html>