Loftiness

Models of PAWednesday, September 30, 20156:15 pmGC 4214-03

Roman Kossak

Loftiness

The City University of New York

Loftiness is a weak version of recursive saturation. It was introduced and studied by Kaufmann and Schmerl in two papers published in 1984 and 1987. I will present basic definitions and results leading to constructions of lofty models of PA that are not recursively saturated.

Roman Kossak is professor of mathematics at The City University of New York, at Bronx Community College and also at the CUNY Graduate Center. He conducts research in mathematical logic, especially in model theory of Peano Arithmetic.

Posted by on September 23rd, 2015