# 2016 seminar talk: ACT forcing

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

### Abstract

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.