Tag Archives: Bea Adam-Day

The random graph and anti-foundation

Last year, Bea Adam-Day, one of my undergraduate project students, settled a question that had been bugging me for years. According to the downward Löwenheim–Skolem Theorem of first-order logic (a consequence of the proof of Gödel’s Completeness Theorem), if a … Continue reading

Posted in doing mathematics, exposition | Tagged , , , | 3 Comments