MetalogicBMA-LOTD-203.04, BMI-LOTD-203E.04
András Máté
2024 Fall semester
Friday 10:00-11:30, classroom i/221
First class: 12th September
There will be no class on 19th September!
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.
Grade requirements
Your grade depends on your performance in solving excercises (at the classes or as homeworks)
Required
reading:
Imre Ruzsa,
Introduction to Metalogic. Budapest: Áron Publishers,
1997.
Presentations:
12th September
|
|
