Results 1 to 10 of about 3,708 (81)
L-Fuzzy Congruences and L-Fuzzy Kernel Ideals in Ockham Algebras
Journal of Mathematics, 2021 In this paper, we study fuzzy congruence relations and kernel fuzzy ideals of an Ockham algebra A,f, whose truth values are in a complete lattice satisfying the infinite meet distributive law.
Teferi Getachew Alemayehu +2 more
doaj +1 more source
Rough sets based on fuzzy ideals in distributive lattices
Open Mathematics, 2020 In this paper, we present a rough set model based on fuzzy ideals of distributive lattices. In fact, we consider a distributive lattice as a universal set and we apply the concept of a fuzzy ideal for definitions of the lower and upper approximations in ...
Yang Yongwei, Zhu Kuanyun, Xin Xiaolong
doaj +1 more source
Random walks on semaphore codes and delay de Bruijn semigroups [PDF]
, 2015 We develop a new approach to random walks on de Bruijn graphs over the alphabet $A$ through right congruences on $A^k$, defined using the natural right action of $A^+$.
Rhodes, John +2 more
core +2 more sources
On Congruence Compact Monoids [PDF]
, 1999 A universal algebra is called congruence compact if every family of congruence classes with the finite intersection property has a non-empty intersection.
Bulman-Fleming, Sydney
core +2 more sources
The Reticulation of a Universal Algebra [PDF]
, 2017 The reticulation of an algebra $A$ is a bounded distributive lattice ${\cal L}(A)$ whose prime spectrum of filters or ideals is homeomorphic to the prime spectrum of congruences of $A$, endowed with the Stone topologies.
Georgescu, George, Mureşan, Claudia
core +2 more sources
The possible values of critical points between strongly congruence-proper varieties of algebras [PDF]
, 2014 We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras.
Elliott +24 more
core +3 more sources
Cevian operations on distributive lattices [PDF]
, 2019 We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation - satisfying the ...
Wehrung, Friedrich
core +4 more sources
Distributive Lattices have the Intersection Property [PDF]
, 2019 Distributive lattices form an important, well-behaved class of lattices. They are instances of two larger classes of lattices: congruence-uniform and semidistributive lattices.
Mühle, Henri
core +2 more sources
Lattices of quasi-equational theories as congruence lattices of semilattices with operators, Part I [PDF]
, 2012 We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equational theories of K (the dual of the lattice of sub-quasivarieties of K) is ...
Adaricheva K. V. +6 more
core +12 more sources
On tractability and congruence distributivity [PDF]
, 2007 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