Seminar Details
Compactness in Combinatorics
- Start Date: February 15, 2023
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Caleb Fong - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p>See: <a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
- Presentation Type: Stand Alone Presentation
- Abstract:
When a finite statement in discrete maths is being extended to its infinite analogue, a useful method for brushing details under the rug is to say that we "use a standard compactness argument". In this talk, I will try to outline the basic structure of these arguments using many examples, give some idea for the underlying machinery (the Compactness Theorem from first-order logic), and if time permits � give some settings in which these proofs don't work.
