Chains and antichains of finitely axiomatizable theories conservative over Peano arithmetic
This will be a talk at the CUNY Models of Peano Arithmetic Seminar on Wednesday, October 18.
It is well-known that there are finitely axiomatizable theories which are conservative over Peano arithmetic. Perhaps the best known of these is , the third of the “big five” subsystems of second-order arithmetic from reverse mathematics. Other examples of such theories come from the addition of satisfaction classes, as a consequence of a famous result by Kotlarski, Krajewski, and Lachlan. In unpublished work, Krajewski extended these ideas to construct chains and antichains of finitely axiomatizable theories conservative over . I will present his results. Namely, I will show (1) that there are length ascending and descending -chains of finitely axiomatizable theories conservative over . We will also get chains of such theories of order . I will additionally show (2) that there are countable -antichains of finitely axiomatizable theories conservative over .