Results 1 to 10 of about 8,927 (77)
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 +3 more sources
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
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
“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. In this paper we show the existence of infinite complete-simple distributive lattices.
Grätzer, G., Schmidt, E. T.
openaire +1 more source
Axiomatics for the external numbers of nonstandard analysis [PDF]
, 2017 Neutrices are additive subgroups of a nonstandard model of the real numbers. An external number is the algebraic sum of a nonstandard real number and a neutrix.
Berg, Imme van den, Dinis, Bruno
core +2 more sources
Weak Distributivity Implying Distributivity [PDF]
, 2016 Let $\mathbb{B}$ be a complete Boolean algebra. We show, as an application of a previous result of the author, that if $\lambda$ is an infinite cardinal and $\mathbb{B}$ is weakly $(\lambda^\omega, \omega)$-distributive, then $\mathbb{B}$ is $(\lambda, 2)
Hathaway, Dan
core +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
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
Free completely distributive lattices [PDF]
Proceedings of the American Mathematical Society, 1979 We show that the usual construction of the free distributive lattice on n generators generalizes to an arbitrary quantity of generators and actually yields a free completely distributive lattice. Furthermore, for an infinite number of generators the cardinality of the corresponding free completely distributive lattice is exactly that of the power set ...
openaire +1 more source
On the homomorphism order of labeled posets [PDF]
, 2009 Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets.
A Pultr +22 more
core +3 more sources