Minimal models for second-order set theories
This is a contributed talk at the 2018 ASL North American Annual Meeting on 17 May 2018.
Shepherdson and, independently, Cohen showed that there is a least transitive model of , i.e. a transitive model of which is contained inside every transitive model of . An analogous question can be asked of other set theories. I will consider second-order set theories, those which have both sets and classes as their objects. It was known to Shepherdson that von Neumann–Bernays–Gödel set theory has a smallest transitive model. I will show that this phenomenon fails for stronger second-order set theories: there is no least transitive model of Kelley–Morse set theory . Indeed, there is no least transitive model of -Comprehension, nor any computably enumerable extension thereof. On the other hand, fragments of + Elementary Transfinite Recursion, which sit between and -Comprehension in consistency strength, do have least transitive models.