Metalogic

Metalogic investigates the properties of formalized theories (such as negation-completeness, semantic completeness, decidability, consistency) within the framework of some (formalized or at least formalizable) theory. This course is based on Imre Ruzsa's theory of canonical calculi and the Markov algorithms. It covers their structure, their interrelations (their interdefinability) and the proof of well-known theorems of metalogic (Gödel's theorems, the Church-Turing theorem and Tarski's theorem on the indefinability of truth) in this framework, in an abstract and general form.

Required reading:

Presentations: