Results 11 to 20 of about 1,290 (174)
Predicative theories of continuous lattices [PDF]
Logical Methods in Computer Science, 2021 We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the coalgebras of
Tatsuji Kawai
doaj +1 more source
On general n-ary hyperstructure semilattices [PDF]
Journal of Hyperstructures, 2016 In this paper, the n-ary hyperstructure will be applied to some aspects of lattice theory. We introduce the concepts of general n-ary hyperstructure semilattice ( or gnh-semilattice) and Gnh-subsemilattice, ideal of gnh-semilattice, gno-order, Gnoorder ...
Akbar Dehghan Nezhad, Najmeh Khajuee
doaj +1 more source
Congruence on a strong semilattice of π-groups
上海师范大学学报. 自然科学版, 2022 It is well known that a semigroup is a Clifford semigroup， if and only if it is a strong semilattice of groups， and the class of π-groups is the generalization of groups in the range of π-regular semigroups.
DAI Luyao, ZHANG Jiangang, SHEN Ran
doaj +1 more source
Monotone and cone preserving mappings on posets [PDF]
Mathematica Bohemica, 2023 We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to study in which posets some of these mappings coincide.
Ivan Chajda, Helmut Länger
doaj +1 more source
On strategy-proofness and semilattice single-peakedness [PDF]
, 2019 Altres ajuts: UNSL/319502We 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 ...
Institut d'Anàlisi Econòmica +3 more
core +7 more sources
Hilbert algebras as implicative partial semilattices [PDF]
Open Mathematics, 2007 summary:Let $A := (A,\rightarrow ,1)$ be a Hilbert algebra. The monoid of all unary operations on $A$ generated by operations $\alpha _p\colon x \mapsto (p \rightarrow x)$, which is actually an upper semilattice w.r.t.
Cīrulis Jānis
doaj +2 more sources
A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite
Axioms, 2021 A subset A of a semigroup S is called a chain (antichain) if ab∈{a,b} (ab∉{a,b}) for any (distinct) elements a,b∈A. A semigroup S is called periodic if for every element x∈S there exists n∈N such that xn is an idempotent.
Iryna Banakh +2 more
doaj +1 more source
Proceedings of the American Mathematical Society, 1978 Let S (respectively S
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