Results 11 to 20 of about 9,046 (195)
Algebraic characterizations of measure algebras [PDF]
We present necessary and sufficient conditions for the existence of a countably additive measure on a complete Boolean ...
Jech, Thomas
core +4 more sources
Completely Operator Semi-Selfdecomposable Distributions [PDF]
In a previous paper [ibid. 22, No. 2, 473-509 (1999; Zbl 0947.60010)] the authors have introduced operator semi-selfdecomposable distributions.
MAEJIMA, Makoto +2 more
openaire +2 more sources
Left-Garside categories, self-distributivity, and braids [PDF]
In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid.
Dehornoy, Patrick
core +5 more sources
Complete and Symmetrically Complete Families of Distributions
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
Complete Congruence Lattices of Complete Distributive Lattices
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
On tractability and congruence distributivity [PDF]
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi.
Emil Kiss, Matt Valeriote, Neil Immerman
core +4 more sources
Polarity in a Completely Distributive Complete Lattice [PDF]
We introduce p p -bases in completely distributive complete polarity lattices and give a procedure for generating these lattices by p p -bases.
openaire +1 more source
Equational characterizations for some subclasses of domains
It is well known that the continuity of a poset can be seen as a special distributivity. There is an open problem: is there an equational characterization for continuous semilattices?
Feng Fan, Li Xiangrui
doaj +1 more source
Quasi-atoms and complete distributivity [PDF]
We introduce quasi-atoms in completely distributive complete lattices and use them to treat the representation of these lattices and their connection with a binary relation.
openaire +1 more source
Computing with Coloured Tangles
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram.
Carmi, Avishy Y., Moskovich, Daniel
core +2 more sources

