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



Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki:
Year:
Volume:
Issue:
Page:
Find






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


Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2017, Volume 27, Issue 2, Pages 283–291 (Mi vuu587)  

This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

Unlocking of predicate: application to constructing a non-anticipating selection

D. A. Serkovab

a N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620219, Russia
b Institute of Radioelectronics and Information Technologies, Ural Federal University, ul. Mira, 32, Yekaterinburg, 620002, Russia

Abstract: We consider an approach to constructing a non-anticipating selection of a multivalued mapping; such a problem arises in control theory under conditions of uncertainty. The approach is called “unlocking of predicate” and consists in the reduction of finding the truth set of a predicate to searching fixed points of some mappings. Unlocking of predicate gives an extra opportunity to analyze the truth set and to build its elements with desired properties. In this article, we outline how to build “unlocking mappings” for some general types of predicates: we give a formal definition of the predicate unlocking operation, the rules for the construction and calculation of “unlocking mappings” and their basic properties. As an illustration, we routinely construct two unlocking mappings for the predicate “be non-anticipating mapping” and then on this base we provide the expression for the greatest non-anticipating selection of a given multifunction.

Keywords: predicate unlocking, fixed points, nonanticipating mappings.

DOI: https://doi.org/10.20537/vm170211

Full text: PDF file (246 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 510.635, 517.988.52, 519.833, 517.977
MSC: 37N35, 65J15, 47J25, 52A01, 91A25
Received: 01.02.2017
Language:

Citation: D. A. Serkov, “Unlocking of predicate: application to constructing a non-anticipating selection”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:2 (2017), 283–291

Citation in format AMSBIB
\Bibitem{Ser17}
\by D.~A.~Serkov
\paper Unlocking of predicate: application to constructing a non-anticipating selection
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2017
\vol 27
\issue 2
\pages 283--291
\mathnet{http://mi.mathnet.ru/vuu587}
\crossref{https://doi.org/10.20537/vm170211}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000467759800011}
\elib{http://elibrary.ru/item.asp?id=29410199}


Linking options:
  • http://mi.mathnet.ru/eng/vuu587
  • http://mi.mathnet.ru/eng/vuu/v27/i2/p283

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


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

    This publication is cited in the following articles:
    1. D. A. Serkov, “K postroeniyu mnozhestva istinnosti predikata”, Izv. IMI UdGU, 50 (2017), 45–61  mathnet  crossref  elib
  • Вестник Удмуртского университета. Математика. Механика. Компьютерные науки
    Number of views:
    This page:127
    Full text:87
    References:24

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019