On the construction of a predicate truth set
Dmitrii Aleksandrovich Serkov · Izvestiya Instituta Matematiki i Informatiki Udmurt Gos Univ · 2017
We provide an approach to constructing a predicate truth set, which we refer to as unlocking of predicate.The approach reduces the problem of searching for a predicate truth set to searching for a set of xed points of some mappings (hereinafter unlocking mappings).Unlocking of predicate gives an extra opportunity to analyze the truth set and to build its elements with desired properties.In this paper, we outline how to build unlocking mappings for some general types of predicates: we give a formal denition of the predicate unlocking operation, rules for the construction and calculation of unlocking mappings and their basic properties.As an illustration, we routinely construct unlocking mappings for predicates be a Nash equilibrium and be non-anticipating mapping; then on this basis we provide expressions for corresponding truth sets.