"Reverse and Recursive Combinatorics "

ABSTRACT:

Some proofs in math are nonconstructive. Both Nerode's recursive math program and H. Freidman's reverse math program are ways to try to quantify and understand this phenomena (e.g., do some theorems REQUIRE nonconstructive proofs?) This talk will survey both of these fields and include historical motivation. The main examples given will be from infinite combinatorics. For example, the infinite Ramsey theory uses nonconstructive techniques--- does it have to? Come and find out!
 

Back to Talks Page