A. L. Semenov, S. F. Soprunov, “A combinatorial version of the Svenonius theorem on definability”, Logic Journal of the IGPL, 2015, Volume 23, Issue 6, Pages 966

Logic Journal of the IGPL

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Logic Journal of the IGPL, 2015, Volume 23, Issue 6, Pages 966–975
DOI: https://doi.org/10.1093/jigpal/jzv038 (Mi ljour2)

This article is cited in 3 scientific papers (total in 3 papers)

A combinatorial version of the Svenonius theorem on definability

A. L. Semenov, S. F. Soprunov

Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, Moscow, Russia

Citations (3)

DOI: https://doi.org/10.1093/jigpal/jzv038

Funding agency	Grant number
Russian Science Foundation	14-50-00005
The authors are thankful to Prof. Vladimir Uspensky for his inspiration in mathematical research, to the referees for helpful valuable suggestions, and to Yuri Boravlev for technical assistance. This work is supported by the Russian Science Foundation under grant 14-50-00005 with donation of Moscow State University of Education and performed in Steklov Mathematical Institute of Russian Academy of Sciences.

Received: 09.05.2014

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/ljour2

This publication is cited in the following 3 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	84