University of Birmingham > Talks@bham > Theoretical computer science seminar > Reflection principles in subsystems of analysis

Reflection principles in subsystems of analysis

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Noam Zeilberger.

The study of reflection principles goes back to Feferman “Transfinite recursive progressions of axiomatic theories” (1962), and originates from Turing (PhD) thesis “Systems of logic based on ordinals” (1938). Worth of mention is the work of Schmerl and Beklemishev. Long story short, we know a lot about reflection in first order arithmetic. If we look at analysis (classical second order arithmetic), we hardly have the same picture. In the context of analysis, people have studied omega-model reflection (Friedman, Simpson, Jager and Strahm) and well-ordering principles (Rathjen, Weiermann, Afshari, Montalban, Marcone and others). Yet the big question remains: what reflection principles, if any, give a precise measure of the proof-theoretic strength of a given subsystem of analysis? Spoiler: The big question will not be answered in this talk.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.