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.
ACT forcing
24.11.2016 15:00 - 16:30
Organiser:
KGRC
Location:
SR 101, 2. St., Währinger Str. 25