Recursive definability of the standard cut

Models of PAWednesday, October 28, 20156:15 pmGC 4214-03

Kameryn Williams

Recursive definability of the standard cut

The CUNY Graduate Center

Say that the standard cut in a model of arithmetic is recursively definable if there is a recursive sequence coinitial in the nonstandard elements. We will construct minimal models in which the standard cut is recursively definable and minimal models in which the standard cut is not recursively definable.

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.

Posted by on October 24th, 2015