Compatibility in D-posets (Q1907574): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic Analysis of Many Valued Logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5286025 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tensor Product of Difference Posets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy quantum spaces and compatibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Filters and supports in orthoalgebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4291523 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325722 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthomodular structures as quantum logics. Transl. from the Slovak / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3958461 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:42, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Compatibility in D-posets |
scientific article |
Statements
Compatibility in D-posets (English)
0 references
6 March 1996
0 references
A partially ordered set \((P, \leq)\) with the smallest element 0, the greatest element 1, and a binary operation \(-\) is called a Boolean D-poset, if the following properties are satisfied: 1.) \(a-0= a\). 2.) If \(a\leq b\), then \(c- b\leq c- a\). 3.) \((c- a)- b= (c- b)- a\). 4.) \(b- (b- a)=a- (a- b)\). The main result states that any subset \(E\) of a Boolean D-poset \(P\) is compatible, i.e. every finite subset \(F\subset P\) is compatible. This means that there exists a \(\oplus\)-orthogonal system \(G\) such that every element of \(F\) is a sum of a finite number of elements of \(G\). Two elements \(a\), \(b\) are orthogonal if \(a\leq 1-b\) and their sum is defined by \(a\oplus b= 1- ((1- a)- b)\).
0 references
compatibility
0 references
orthogonality
0 references
Boolean D-poset
0 references