نتایج جستجو برای: meet semilattice
تعداد نتایج: 92701 فیلتر نتایج به سال:
We study all possible constant expansions of the structure dense meet-tree ⟨М; <, П⟩ [3]. Here, a is lower semilattice without least and greatest elements. An example this with expansion theory that has exactly three pairwise non-isomorphic countable models [6], which good in context Ehrenfeucht theories. by using general classification complete theories [7], as well description specificity ...
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a constructive fixed-point theorem for strictly contracting functions on directed-complete generalized ultrametric semilattices, and introduce a corresponding i...
EQ-algebras introduced by Novák are algebras of truth values for a higher-order fuzzy logic (fuzzy type theory). In this paper, the compatibility of multiplication w.r.t. the fuzzy equality in an arbitrary EQ-algebra is examined. Particularly, an example indicates that the compatibility axiom does not always hold, and then a class of EQ-algebras satisfying the compatibility axiom is characteriz...
A b s t r a c t. This paper deals with axiomatization problems for varieties of residuated meet semilattice-ordered monoids (RSs). An internal characterization of the finitely subdirectly irreducible RSs is proved, and it is used to investigate the varieties of RSs within which the finitely based subvarieties are closed under finite joins. It is shown that a variety has this closure property if...
We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of morphisms with fixed target object forms an ortho-complemented meet semilattice. We define the Coxeter complex of a Weyl groupoid with finite root system and show ...
The representation theory of finite groups began with Frobenius's factorization Dedekind's group determinant. In this paper, we consider the case semigroup determinant is nonzero if and only complex algebra Frobenius, so our results include applications to study Frobenius algebras. We explicitly factor for commutative semigroups inverse semigroups. recover Wilf-Lindström a meet semilattice Wood...
As Jonathan Leech has pointed out, many natural examples of inverse semigroups are semilattice ordered under the natural partial order. But there are many interesting examples of semilattice ordered inverse semigroups in which the imposed partial order is not the natural one. In this talk we shall explore the structure and properties of these examples and some other questions related to semilat...
Recently W. Holliday gave a choice-free construction of canonical extension boolean algebra B as the regular open subsets Alexandroff topology on poset proper filters B. We make this point-free by replacing space with free frame $$\mathcal {L}_B$$ generated bounded meet-semilattice all (ordered reverse inclusion) and prove that booleanization is Our main result generalizes approach to category ...
this paper is a continuation of [uniformities and covering properties for partial frames (i)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. after presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...
We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe its monolith. The endomorphism semiring is congruence simple if and only if the semilattice has both a least and a largest element.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید