Results 11 to 20 of about 10,642 (232)
A metrizable semitopological semilattice with non-closed partial order
Topological Algebra and its Applications, 2020 We construct a metrizable semitopological semilattice X whose partial order P = {(x, y) ∈ X × X : xy = x} is a non-closed dense subset of X × X. As a by-product we find necessary and sufficient conditions for the existence of a (metrizable) Hausdorff ...
Banakh Taras +2 more
doaj +2 more sources
On feebly compact topologies on the semilattice $\exp_n\lambda$ [PDF]
, 2016 We study feebly compact topologies $\tau$ on the semilattice $\left(\exp_n\lambda,\cap\right)$ such that $\left(\exp_n\lambda,\tau\right)$ is a semitopological semilattice. All compact semilattice $T_1$-topologies on $\exp_n\lambda$ are described.
Gutik, Oleg, Sobol, Oleksandra
core +3 more sources
H-Fuzzy Ideals and H-Fuzzy Filters in Distributive Join-Semilattices
Journal of MathematicsThis paper investigates H-fuzzy ideals of distributive join-semilattices with least element 0 whose codomain is a complete lattice that satisfies the infinite meet distributive law.
Mohammed Amare Mohammed +3 more
doaj +2 more sources
Semilattice Base Hierarchy for Frames and Its Topological Ramifications [PDF]
Applied Categorical Structures, 2023 We develop a hierarchy of semilattice bases (S-bases) for frames. For a given (unbounded) meet-semilattice A, we analyze the interval in the coframe of sublocales of the frame of downsets of A formed by all frames with the S-base A.
G. Bezhanishvili +3 more
semanticscholar +1 more source
Constraint satisfaction problems over semilattice block Mal'tsev algebras [PDF]
Logic in Computer Science, 2017 There are two well known types of algorithms for solving CSPs: local propagation and generating a basis of the solution space. For several years the focus of the CSP research has been on ‘hybrid’ algorithms that somehow combine the two approaches.
A. Bulatov
semanticscholar +1 more source
On strategy-proofness and semilattice single-peakedness
Games Econ. Behav., 2020 We study social choice rules defined on the domain of semilattice singlepeaked preferences. Semilattice single-peakedness has been identified as the necessary condition that a set of preferences must satisfy so that the set can be the domain of a ...
Agustín G. Bonifacio, Jordi Massó
semanticscholar +1 more source
On the Semilattice of Modal Operators and Decompositions of the Discriminator [PDF]
Hajnal Andréka and István Németi on Unity of Science, 2018 We investigate the join semilattice of modal operators on a Boolean algebra $B$. Furthermore, we consider pairs $(f,g)$ of modal operators whose supremum is the unary discriminator on $B$, and study the associated bi--modal algebras.
Ivo Duntsch, Wojciech Dzik, E. Orlowska
semanticscholar +1 more source
Proceedings of the American Mathematical Society, 1978 Let S (respectively S 0 {{\mathbf {S}}_0} ) denote the category of all join-semilattices (resp. join-semilattices with 0) with (0-preserving) semilattice homomorphisms. For A ∈ S A \in
Bulman-Fleming, Sydney +1 more
openaire +2 more sources
Relational Theory of Risk and Its Applications to Game Theory Problems of Non-Numerical Economics
Статистика и экономика, 2021 The purpose of the work is to study the foundations of a general risk theory. To form a single formal concept of risk, a number of definitions of the term “risk” found in the literature have been analyzed.
T. A. Urazaeva
doaj +1 more source
CoRR, 2021 We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible component, and the set of atoms forms a hypergraph that fully defines the semilattice. An atomization always exists and is
Fernando Martin-Maroto +1 more
openaire +2 more sources