Return to Colloquia & Seminar listing
A Topological Proof of the Compactness Theorem
Student-Run Research| Speaker: | Qiang Wang, UC Davis |
| Location: | 693 Kerr |
| Start time: | Wed, Jun 1 2005, 12:10PM |
Description
This Compactness is NOT that Compactness. The Compactness Theorem of Logic says (roughly): A infinite set of statements is satisfiable (having a
model) if and only if any finite subset of it is satisfiable.
There are two well known proofs of this theorem (well-known in the sense
that it is included in many common logic texts).
The name and the statement of this theorem suggests strongly some
connection to topology; and in fact there is a topological proof of this
statement.