Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2007, Volume 13, Number 2, Pages 184–217 (Mi timm100)  

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

Extensions of abstract problems of attainability: Nonsequential version

A. G. Chentsov
References:
Abstract: Extension constructions of the problem of attainability in a topological space are studied. The constructions are based on compactification of the whole space of solutions or some of its fragments.
Received: 11.11.2006
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2007, Volume 259, Issue 2, Pages S46–S82
DOI: https://doi.org/10.1134/S0081543807060041
Bibliographic databases:
Document Type: Article
UDC: 517.972.8
Language: Russian
Citation: A. G. Chentsov, “Extensions of abstract problems of attainability: Nonsequential version”, Trudy Inst. Mat. i Mekh. UrO RAN, 13, no. 2, 2007, 184–217; Proc. Steklov Inst. Math. (Suppl.), 259, suppl. 2 (2007), S46–S82
Citation in format AMSBIB
\Bibitem{Che07}
\by A.~G.~Chentsov
\paper Extensions of abstract problems of attainability: Nonsequential version
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2007
\vol 13
\issue 2
\pages 184--217
\mathnet{http://mi.mathnet.ru/timm100}
\elib{https://elibrary.ru/item.asp?id=12040780}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2007
\vol 259
\issue , suppl. 2
\pages S46--S82
\crossref{https://doi.org/10.1134/S0081543807060041}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-38949118063}
Linking options:
  • https://www.mathnet.ru/eng/timm100
  • https://www.mathnet.ru/eng/timm/v13/i2/p184
  • This publication is cited in the following 21 articles:
    1. A. G. Chentsov, “Nekotorye voprosy, svyazannye s rasshireniem zadach o dostizhimosti v klasse konechno-additivnykh mer”, Tr. IMM UrO RAN, 30, no. 3, 2024, 293–313  mathnet  crossref  elib
    2. A. G. Chentsov, “Some Questions Related to the Extension of Reachability Problems in the Class of Finitely Additive Measures”, Proc. Steklov Inst. Math., 327:S1 (2024), S44  crossref
    3. A. G. Chentsov, “Closed Mappings and Construction of Extension Models”, Proc. Steklov Inst. Math. (Suppl.), 323, suppl. 1 (2023), S56–S77  mathnet  crossref  crossref  mathscinet  elib
    4. A. G. Chentsov, “Abstraktnaya zadacha o dostizhimosti: “chisto asimptoticheskaya” versiya”, Tr. IMM UrO RAN, 21, no. 2, 2015, 289–305  mathnet  mathscinet  elib
    5. A. G. Chentsov, “Attraction sets in abstract attainability problems: equivalent representations and basic properties”, Russian Math. (Iz. VUZ), 57:11 (2013), 28–44  mathnet  crossref
    6. A. G. Chentsov, “On the question of representation of ultrafilters and their application in extension constructions”, Proc. Steklov Inst. Math. (Suppl.), 287, suppl. 1 (2014), 29–48  mathnet  crossref  mathscinet  isi  elib
    7. A. G. Chentsov, “On certain problems of the structure of ultrafilters related to extensions of abstract control problems”, Autom. Remote Control, 74:12 (2013), 2020–2036  mathnet  crossref  isi
    8. Chentsov A.G., “Generalized limits and representations of attraction sets in problems with constraints of asymptotic character”, Dokl. Math., 85:1 (2012), 83–86  crossref  mathscinet  zmath  isi  elib  elib  scopus
    9. A. G. Chentsov, “Representation of attraction elements in abstract attainability problems with asymptotic constraints”, Russian Math. (Iz. VUZ), 56:10 (2012), 38–49  mathnet  crossref  mathscinet
    10. A. G. Chentsov, “K voprosu o strukture mnozhestv prityazheniya v topologicheskom prostranstve”, Izv. IMI UdGU, 2012, no. 1(39), 147–150  mathnet
    11. A. G. Chentsov, “Preobrazovaniya ultrafiltrov i ikh primenenie v konstruktsiyakh mnozhestv prityazheniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2012, no. 3, 85–102  mathnet
    12. A. G. Chentsov, “Yarusnye otobrazheniya i preobrazovaniya na osnove ultrafiltrov”, Tr. IMM UrO RAN, 18, no. 4, 2012, 298–314  mathnet  elib
    13. A. G. Chentsov, “Ob odnom primere postroeniya mnozhestv prityazheniya s ispolzovaniem prostranstva Stouna”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2012, no. 4, 108–124  mathnet
    14. A. G. Chentsov, “Filtry i ultrafiltry v konstruktsiyakh mnozhestv prityazheniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2011, no. 1, 113–142  mathnet
    15. A. G. Chentsov, “One representation of the results of action of approximate solutions in a problem with constraints of asymptotic nature”, Proc. Steklov Inst. Math. (Suppl.), 276, suppl. 1 (2012), S48–S62  mathnet  crossref  isi  elib
    16. Chentsov A.G., “Ultrafilters in the constructions of attraction sets: problem of compliance to constraints of asymptotic character”, Differ. Equ., 47:7 (2011), 1059–1076  crossref  mathscinet  zmath  isi  elib  elib  scopus
    17. Chentsov A.G., “Elementy prityazheniya v abstraktnoi zadache o dostizhimosti s ogranicheniyami asimptoticheskogo kharaktera”, Vestnik Tambovskogo universiteta. Seriya: Estestvennye i tekhnicheskie nauki, 16:4 (2011), 1213–1219  mathscinet  elib
    18. A. G. Chentsov, Yu. V. Shapar, “Konechno-additivnye mery i rasshireniya igrovykh zadach s ogranicheniyami asimptoticheskogo kharaktera”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2010, no. 1, 89–111  mathnet
    19. A. G. Chentsov, “K voprosu o tochnom i priblizhennom soblyudenii ogranichenii v abstraktnoi zadache upravleniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2010, no. 2, 29–48  mathnet
    20. A. G. Chentsov, “O predstavlenii maksimina v igrovoi zadache s ogranicheniyami asimptoticheskogo kharaktera”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2010, no. 3, 104–119  mathnet
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:477
    Full-text PDF :106
    References:113
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025