2020
DOI: 10.37236/8786
|View full text |Cite
|
Sign up to set email alerts
|

Lattice Representations with Set Partitions Induced by Pairings

Abstract: We call a quadruple $\mathcal{W}:=\langle F,U,\Omega,\Lambda \rangle$, where $U$ and $\Omega$ are two given non-empty finite sets, $\Lambda$ is a non-empty set and $F$ is a map having domain $U\times \Omega$ and codomain $\Lambda$, a pairing on $\Omega$. With this structure we associate a set operator $M_{\mathcal{W}}$ by means of which it is possible to define a preorder $\ge_{\mathcal{W}}$ on the power set $\mathcal{P}(\Omega)$ preserving set-theoretical union. The main results of our paper are two represent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 29 publications
(56 reference statements)
0
0
0
Order By: Relevance
“…Involution partially ordered sets (briefly iinvolution posets) are order structures classically used to describe specific combinatorial aspects in Ockam algebras and de Morgan algebras (see [9] for more details). These posets generalize the classical Boolean algebras [23,38], and in literature they are studied in several different mathematical contexts (see for example [1,11,16,19,25,26,30,31,36,37]). In this paper we use involution posets in a set operatorial perspective, in analogy with what has been recently done for integral domains [14] and monoid actions [15].…”
Section: Introductionmentioning
confidence: 99%
“…Involution partially ordered sets (briefly iinvolution posets) are order structures classically used to describe specific combinatorial aspects in Ockam algebras and de Morgan algebras (see [9] for more details). These posets generalize the classical Boolean algebras [23,38], and in literature they are studied in several different mathematical contexts (see for example [1,11,16,19,25,26,30,31,36,37]). In this paper we use involution posets in a set operatorial perspective, in analogy with what has been recently done for integral domains [14] and monoid actions [15].…”
Section: Introductionmentioning
confidence: 99%