Complexity of classification problems for a class of discretely ordered rings

Model theory seminarFriday, October 7, 201612:30 pmGC 6417

Roman Kossak

Complexity of classification problems for a class of discretely ordered rings

The City University of New York

I will give a standard introduction to the theory of Borel reducibility, including some details for non-logicians. The rest of the talk will be about some results in classification problems for countable nonstandard models of arithmetic due to Samuel Coskey and myself.

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 29th, 2016