A perfectly generic talk

by kamerynwilliams

This was a talk about perfect generics at CUNY’s MoPA seminar.

We will look at perfect generics for countable models of PA. Our goal will be to prove the following theorems: 1. Any countable collection of inductive subsets of a countable model are definable from a single generic. 2. Any countable model has minimally undefinable generics.