Search

Start Over Subject semilattice

1. Characterizations of the 0-distributive semilattice

Creator:
Balasubramani, P.
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
semilattice, prime ideal, and filter
Language:
English
Description:
The 0-distributive semilattice is characterized in terms of semiideals, ideals and filters. Some sufficient conditions and some necessary conditions for 0-distributivity are obtained. Counterexamples are given to prove that certain conditions are not necessary and certain conditions are not sufficient.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

3. Congruence kernels of distributive PJP-semilattices

Creator:
Begum, S. N. and Noor, Abu Saleh Abdun
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
semilattice, distributivity, pseudocomplementation, congruence, kernel ideal, and cokernel
Language:
English
Description:
A meet semilattice with a partial join operation satisfying certain axioms is a JP-semilattice. A PJP-semilattice is a pseudocomplemented JP-semilattice. In this paper we describe the smallest PJP-congruence containing a kernel ideal as a class. Also we describe the largest PJP-congruence containing a filter as a class. Then we give several characterizations of congruence kernels and cokernels for distributive PJP-semilattices.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

4. Degrees of belief in partially ordered sets

Creator:
Kramosil, Ivan
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
belief function, partially ordered set, semilattice, Denipster combination rule, and nonspecificity degree
Language:
English
Description:
Belief functions can be taken as an alternative to the classical probability theory, as a generalization of this theory, but also as a non-traditional and sophisticated application of the probability theory. In this paper we abandon the idea of numerically quantified degrees of belief in favour of the case when belief functions take their vahies in partially ordered sets, perhaps enriched to lower or upper semilattices. Such structures seern to be the most general ones to which reasonable and nontrivial parts of the theory of belief functions can be extended and generalized.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

5. Degrees of belief in partially ordered sets

Creator:
Kramosil, Ivan
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
belief function, partially ordered set, semilattice, Dempster combination rule, and nonspecificity degree
Language:
English
Description:
Belief functions can be taken as an alternative to the classical probability theory, as a generalization of this theory, but also as a non-traditional and sophisticated application of the probability theory. In this paper we abandon the idea of nnmerically quantified degrees of belief in favour of the case when belief functions take their values in partially ordered sets, perhaps enriched to lower or upper semilattices. Such structures seern to be the most general ones to which reasoriable and nontrivial parts of the theory of belief functions can be extended and generalized.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

6. Incomparably continuable sets of semilattices

Creator:
Ježek, Jaroslav and Slavík, Václav
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
semilattice and embedding
Language:
English
Description:
A finite set of finite semilattices is said to be incomparably continuable if it can be extended to an infinite set of pairwise incomparable (with respect to embeddability) finite semilattices. After giving some simple examples we show that the set consisting of the four-element Boolean algebra and the four-element fork is incomparably continuable.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

7. The semiring of 1-preserving endomorphisms of a semilattice

Creator:
Ježek, Jaroslav and Kepka, Tomáš
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
semilattice, semiring, subdirectly irreducible, and simple
Language:
English
Description:
We prove that the semirings of 1-preserving and of 0,1-preserving endomorphisms of a semilattice are always subdirectly irreducible and we investigate under which conditions they are simple. Subsemirings are also investigated in a similar way.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public