Chris Laskowski: Classifying first order theories by Borel reducibility: Status Report
Автор: Hausdorff Center for Mathematics
Загружено: 2025-12-22
Просмотров: 81
Описание:
We highlight what is known and what remains to be known about the Borel complexity of classes of countable models of first-order theories. The dividing lines for classifying countable models of a theory are significantly different from those for analyzing uncountable models, hence new tools need to be developed. We discuss the methods of potential canonical Scott sentences, groundedness, flat structures, and admitting nested sequences. Many examples, some rather unexpected, will be discussed and numerous open problems will be proffered.
This is joint work with Danielle Ulrich.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![Пожалуй, главное заблуждение об электричестве [Veritasium]](https://image.4k-video.ru/id-video/6Hv2GLtnf2c)
