August 12
Athar Abdul-Quader, Purchase College
CP-genericity and neutrality
In a paper with Kossak in 2018, we studied the notion of neutrality: a subset X of a model M of PA is called neutral if the definable closure relation in (M, X) coincides with that in M. This notion was suggested by Dolich. motivated by work by Chatzidakis-Pillay on generic expansions of theories. In this talk, we will look at a more direct translation of the Chatzidakis-Pillay notion of genericity, which we call 'CP-genericity', and discuss its relation to neutrality. The main result shows that for recursively saturated models, CP-generics are always neutral; previously we had known that not all neutral sets are CP-generic.

Video

‚Äč