MetalogicBMA-LOTD-203
BMI-LOTD-203E
András Máté
2023 Spring semester
Friday 14:00-15:30, classroom i/221
Metalogic investigates properties of formalized
theories (so as negation-completeness, semantical completenes, decidability,
consistency) within the framework of some (formalized or at least fomalizable)
theory. This course bases on the theory of canonical calculi by Imre Ruzsa and
on Markov algorithms. It extends to the construction of them, to their
connection (interdefinability) and the demonstration of the well-known theorems
of metalogic (Gödel’s theorems, the Church-Turing theorem and Tarski's theorem on the undefinability of truth) within this
framework in an abstract and general form.
Grade requirements
Your mark will depend on your achivement in solving excercises (at the classes or as homeworks)
Required
reading:
Imre Ruzsa,
Introduction to Metalogic. Budapest: Áron Publishers,
1997. Presentations:
3rd March
10th March
24th March
31st March
14th April
21st April
28th April
5th May
19th May
|
|
