2009
DOI: 10.1007/s00012-009-2105-5
|View full text |Cite
|
Sign up to set email alerts
|

Orthocomplemented lattices with a symmetric difference

Abstract: Modelling an abstract version of the set-theoretic operation of symmetric difference, we first introduce the class of orthocomplemented difference lattices (ODL). We then exhibit examples of ODLs and investigate their basic properties finding, for instance, that any ODL induces an orthomodular lattice (OML) but not all OMLs can be converted to ODLs. We then analyse an appropriate version of ideals and valuations in ODLs and show that the set-representable ODLs form a variety. We finally investigate the questio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(18 citation statements)
references
References 20 publications
0
18
0
Order By: Relevance
“…The ODLs have been systematically studied in [12]- [16] where, among others, several (non-Boolean or even non-set-representable) examples of ODLs can be found. Let us list and verify the properties of ODLs that we shall use in the sequel.…”
Section: Notions and Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The ODLs have been systematically studied in [12]- [16] where, among others, several (non-Boolean or even non-set-representable) examples of ODLs can be found. Let us list and verify the properties of ODLs that we shall use in the sequel.…”
Section: Notions and Resultsmentioning
confidence: 99%
“…The algebraic properties of ODLs have been analysed in the papers [12]- [16]. Let us first recall (see [12]) that an ODL is an algebra L = (X, ∧, ∨, ⊥ , 0, 1, ), where : X 2 → X is a binary operation and (X, ∧, ∨, ⊥ , 0, 1) is an orthocomplemented lattice.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Let us note that each Boolean algebra can be viewed as an ODL (more general ODLs will be met later, see also [10,12]). …”
Section: èöóôó× ø óò 12º Let L Be An Odl Then the Following Statemementioning
confidence: 99%
“…Let us return to the ODLs that are set-representable. They form a variety ( [10]) and in view of the Stone set representation for Boolean algebras they could be seen as nearly Boolean. Though the name itself suggests their definition, let us recall it in more formal terms.…”
Section: èöóôó× ø óò 23º the Algebra Lmentioning
confidence: 99%