November 6
Roman Kossak,
CUNY
Short recursively saturated models of PA as an AEC
Countable short recursively saturated models of PA can serve as bases for abstract elementary classes that are complete but not irreducible. I will explain all these notions and show the construction.