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

DOI10.20537/vm170211zbMath1423.93187arXiv1703.10918OpenAlexW2604769587MaRDI QIDQ4639860

Dmitriy Serkov

Publication date: 11 May 2018

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.10918

zbMATH Keywords

fixed pointsnonanticipating mappingspredicate unlocking

Mathematics Subject Classification ID

Set-valued maps in general topology (54C60) Control/observation systems with incomplete information (93C41) Applications of set theory (03E75)

Related Items (1)

On the construction of a predicate truth set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chain-complete posets and directed sets with applications
• Constructive versions of Tarski's fixed point theorems
• Non-cooperative games
• On von Neumann's minimax theorem
• A generalization of Brouwer's fixed point theorem
• A lattice-theoretical fixpoint theorem and its applications
• On Fixed Point Theory and Its Applications to Equilibrium Models
• An approach to analysis of the set of truth: unlocking of predicate
• Minimax Theorems

This page was built for publication: Unlocking of predicate: application to constructing a non-anticipating selection