|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ЦЭМИ РАН |
||
The Lattice of Definability. Origins, Recent Developments, and Further Directionsстатья Исследовательская статья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 25 июля 2019 г.
- Авторы: Semenov Alexei, Soprunov Sergey, Uspensky Vladimir
- Сборник: Computer Science – Theory and Applications, 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings
- Редактор: Верещагин Николай Константинович
- Серия: Lecture Notes in Computer Science
- Том: 8476
- Год издания: 2014
- Издательство: SPRINGER
- Местоположение издательства: VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311GZ
- Первая страница: 23
- Последняя страница: 38
- DOI: 10.1007/978-3-319-06686-8_3
- Аннотация: The paper presents recent results and open problems on classes of definable relations (definability spaces, reducts, relational algebras) as well as sources for the research starting from the XIX century. Finiteness conditions are investigated, including quantifier alternation depth and number of arguments width. The infinite lattice of definability for integers with a successor function (a non ω-categorical structure) is described. Methods of investigation include study of automorphism groups of elementary extensions of structures under consideration, using Svenonius theorem and a generalization of it.
- Добавил в систему: Золин Евгений Евгеньевич