Nearlattices with an overriding operation (Q633219): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:19, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nearlattices with an overriding operation |
scientific article |
Statements
Nearlattices with an overriding operation (English)
0 references
31 March 2011
0 references
A nearlattice is a meet semilattice in which every initial segment is a lattice. It is said to be Boolean if all of these lattices are Boolean. Overriding of \(a\) and \(b\) is a binary operation defined as the supremum of all elements \(x\) such that \(x\) is below \(a\) and the join of \(x\) and \(b\) exists or \(x\) is below \(b\). In particular, overriding extends the partial join operation. Natural examples of overriding nearlattices are, e.g., trees and appropriate algebras of partial functions. For example, every complete semilattice is an overriding nearlattice. In a particular case, an overriding nearlattice becomes the so-called o-nearlattice where the operation of overriding coincides with join. In the paper, elementary properties of orerriding are studied, an axiomatic description is obtained and several results concerning associativity of this operation are presented. Functional o-semilattices are studied and subdirectly irreducible members of this variety are characterized. The main result is a representation theorem for Boolean nearlattices with associative overriding.
0 references
nearlattice
0 references
semilattice
0 references
overriding
0 references
tree
0 references
subdirect irreducibility
0 references