2016 seminar talk: ACT forcing

Talk held by Tin Lok Wong (KGRC) at the KGRC seminar on 2016-11-24.


ACT stands for "Arithmetized Completeness Theorem". The usual proof of Gödel's Completeness Theorem for first-order logic is evidently a forcing-style construction. In many applications, such a construction can easily be transformed into a (complicated perhaps, but natural) recursive construction. I will talk about one example for which this is not the case in the model theory of arithmetic.

Bottom menu

Kurt Gödel Research Center for Mathematical Logic. Währinger Straße 25, 1090 Wien, Austria. Phone +43-1-4277-50501. Last updated: 2010-12-16, 04:37.