Two lectures on reverse mathematics and computable combinatorics
Carl G. Jockusch, Jr.
- Herrmann's work on the arithmetical complexity of infinite
chains and antichains in computable partial orderings.
- The logical strength and effective content of the thin set theorem and the free set theorem.