Form of presentation | Articles in international journals and collections |
Year of publication | 2016 |
Язык | английский |
|
Selivanov Viktor Lvovich, author
|
|
Kudinov Oleg , author
|
Bibliographic description in the original language |
Kudinov O.V. On the lattices of effectively open sets / O.V. Kudinov, V.L. Selivanov // Lecture Notes in Computer Science, CiE 2016 (Eds. Arnold Beckmann et al.). - 2016. - V. 9709. - DOI: 10.1007/978-3-319-40189-8 31. |
Annotation |
We study decidability issues for elementary theories of the lattices of open sets. For many natural effective spaces undecidability of such theories is established, and for some of them a precise complexity estimate is achieved. |
Keywords |
Effective space, effectively open set, elementary theory, undecidability. |
The name of the journal |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=181603&p_lang=2 |
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Selivanov Viktor Lvovich |
ru_RU |
dc.contributor.author |
Kudinov Oleg |
ru_RU |
dc.date.accessioned |
2016-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2016-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2016 |
ru_RU |
dc.identifier.citation |
Kudinov O.V. On the lattices of effectively open sets / O.V. Kudinov, V.L. Selivanov // Lecture Notes in Computer Science, CiE 2016 (Eds. Arnold Beckmann et al.). - 2016. - V. 9709. - DOI: 10.1007/978-3-319-40189-8 31. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=181603&p_lang=2 |
ru_RU |
dc.description.abstract |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
ru_RU |
dc.description.abstract |
We study decidability issues for elementary theories of the lattices of open sets. For many natural effective spaces undecidability of such theories is established, and for some of them a precise complexity estimate is achieved. |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
Effective space |
ru_RU |
dc.subject |
effectively open set |
ru_RU |
dc.subject |
elementary theory |
ru_RU |
dc.subject |
undecidability. |
ru_RU |
dc.title |
On the lattices of effectively open sets |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|