Results 1 to 10 of about 337 (222)
A Note on the Topologicity of Quantale-Valued Topological Spaces [PDF]
Logical Methods in Computer Science, 2017 For a quantale ${\sf{V}}$, the category $\sf V$-${\bf Top}$ of ${\sf{V}}$-valued topological spaces may be introduced as a full subcategory of those ${\sf{V}}$-valued closure spaces whose closure operation preserves finite joins.
Hongliang Lai, Walter Tholen
doaj +1 more source
Some Advantages of the RDM-arithmetic of Intervally-Precisiated Values [PDF]
International Journal of Computational Intelligence Systems, 2015 Moore's interval arithmetic always provides the same results of arithmetic operations, e.g. [1, 3]+ [5, 9]= [6, 12]. But in real life problems, the operation result can be different, e.g. equal to [4, 7].
Andrzej Piegat, Marcin Plucinski
doaj +1 more source
The Algebraic Intersection Type Unification Problem [PDF]
Logical Methods in Computer Science, 2017 The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems.
Andrej Dudenhefner +2 more
doaj +1 more source
“Complete-simple” distributive lattices [PDF]
Proceedings of the American Mathematical Society, 1993 It is well known that the only simple distributive lattice is the two-element chain. We can generalize the concept of a simple lattice to complete lattices as follows: a complete lattice is complete-simple if it has only the two trivial complete congruences.
Grätzer, G., Schmidt, E. T.
openaire +1 more source
Completely distributive latices [PDF]
Fundamenta Mathematicae, 1983 A map p from a complete lattice L to itself is said to \(\vee\)-define L, if \(a=\sup\{b|\) \(a\nleq p(b)\}\) for all a,\(b\in L\). The main result: A complete lattice is completely distributive if and only if there exists a map p:\(L\to L\) which \(\vee\)-defines L. Several examples are given and some known characterizations of completely distributive
openaire +1 more source
Complete and Symmetrically Complete Families of Distributions
The Annals of Statistics, 1987 The paper presents a variety of results of the type ``completeness implies symmetric completeness''. Symmetric completeness of order k of a family of probability measures means that the family of k th powers of the probability measures is complete for the family of symmetric functions.
Mandelbaum, Avi, Ruschendorf, Ludger
openaire +2 more sources
About chaotization mechanisms of the distributed dynamical systems which are close to discrete
Discrete Dynamics in Nature and Society, 1997 The investigations of stochastization mechanisms of distributed dynamical systems (DDS) are developed not so complete as stochastization of dynamical systems with concentrated parameters (CDS).
Yu. P. Bliokh +2 more
doaj +1 more source
Polarity in a Completely Distributive Complete Lattice [PDF]
Proceedings of the American Mathematical Society, 1988 We introduce p p -bases in completely distributive complete polarity lattices and give a procedure for generating these ...
openaire +1 more source
Complete Congruence Lattices of Complete Distributive Lattices
Journal of Algebra, 1995 The authors deal with the question of whether every complete lattice \(L\) is isomorphic to the lattice of complete congruence relations of a suitable complete lattice \(K\). They prove that \(K\) can always be chosen as a complete distributive lattice. In fact, they prove a more general result: Let \(m\) be a regular cardinal \(>\aleph_ 0\). Every \(m\
Gratzer, G., Schmidt, E.T.
openaire +2 more sources