Results 1 to 10 of about 128 (122)
Normally Preordered Spaces and Utilities [PDF]
Order, 2011 17 pages, 1 figure. v2 contains a second proof to the main theorem with respect to the published version. The last section of v1 is not present in v2.
Ettore Minguzzi
exaly +5 more sources
Rough Approximations on Preordered Sets [PDF]
International Journal of Fuzzy Logic and Intelligent Systems, 2011 In this paper, we investigate the properties of rough approximations defined by preordered sets. We study the relations among the lower and upper rough approximations, closure and interior systems, and closure and interior operators.
Yong Chan Kim, Young-Sun Kim
exaly +2 more sources
Fixed-Point and Random Fixed-Point Theorems in Preordered Sets Equipped with a Distance Metric
MathematicsThis paper explores fixed points for both contractive and non-contractive mappings in traditional b-metric spaces, preordered b-metric spaces, and random b-metric spaces.
Jen-Chih Yao +2 more
exaly +3 more sources
Fixed point theorems for Geraghty-type mappings applied to solving nonlinear Volterra-Fredholm integral equations in modular G-metric spaces [PDF]
Arab Journal of Mathematical Sciences, 2021 Purpose – The authors prove the existence and uniqueness of fixed point of mappings satisfying Geraghty-type contractions in the setting of preordered modular G-metric spaces.
Godwin Amechi Okeke, Daniel Francis
doaj +1 more source
On nominal sets with support-preorder [PDF]
Categories and General Algebraic Structures with Applications, 2022 Each nominal set 𝑋 can be equipped with a preorder relation ⪯ defined by the notion of support, so-called support-preorder. This preorder also leads us to the support topology on each nominal set.
Aliyeh Hossinabadi +2 more
doaj +1 more source
The Quotient in Preorder Theories [PDF]
Electronic Proceedings in Theoretical Computer Science, 2020 In Proceedings GandALF 2020, arXiv:2009 ...
Inigo Incer Romeo +3 more
openaire +3 more sources
Multiparty Testing Preorders [PDF]
Logical Methods in Computer Science, 2016 Variants of the must testing approach have been successfully applied in service oriented computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have
Rocco De Nicola, Hernán C. Melgratti
openaire +8 more sources
Updating Utility Functions on Preordered Sets
Mathematics, 2023 We consider the problem of extending a function fP defined on a subset P of an arbitrary set X to X strictly monotonically with respect to a preorder ≽ defined on X , without imposing continuity constraints.
Pavel Chebotarev
doaj +1 more source
, 2013 Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity $O(n^{3}m)$, compares favourably with ...
Manish Gaur, S. Arun-Kumar
openaire +1 more source
Index appearance record with preorders [PDF]
Acta Informatica, 2021 AbstractTransforming $$\omega $$ ω -automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records.
Jan Kretínský +3 more
openaire +2 more sources