Poster

Wednesday, April 22, 20154:50 pmModels of PAGC 6300

A perfectly generic talk

Kameryn Williams

The CUNY Graduate Center

Kameryn Williams

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.

Kameryn Williams is a graduate student in mathematics at the CUNY Graduate
Center, specializing in set theory and mathematical logic. He received a
bachelor’s degree in mathematics from Boise State University in 2012.