Thesis - Leigh Moody.pdf - Bad Request - Cranfield University

Glossary
_ _
{ a ; ∀ i [ 1(
1 ) N ( A ) ] }
A ≡ i ∈
a ∈ A (a) is an element of the set (A)
a ∉ A (a) is not an element of the set (A)
N(A) Number of elements in the set (A)
NMAX(A) Maximum number of elements allowed in the set (A)
max (A) Maximum value of the elements in the set (A)
min (A) Minimum value of the elements in the set (A)
A : = ∅ The set (A) is the null, or empty set
A ⊆ B Set (A) is a subset of the set (B)
A ⊄ B Set (A) is not a subset of the set (B), i.e. sets (A) and (B) are
disjoint.
A ∩ B Intersection of sets - the set containing the elements that are
x: x ∈ A ∧ x ∈ B
common to both set (A) and set (B) : { }
A ∪ B Union of sets - the set containing the elements in both set (A)
x: x ∈ A ∨ x ∈ B
and set (B) : { }
A − B Elements in set (A) that are not in set (B) :
x: x ∈ A ∧ x ∉ B
U m
i : = n
I m
i : = n
( A )
i
( A )
0.5 Number Ranges
i
{ }
Union of sets , i ∈[
n ( 1 ) m]
n
n
1
A i
A ∪ A + ∪ L ∪ A
xxx
∀ ; the set
Intersection of sets , i ∈[
n ( 1 ) m]
n
n
1
A i
A ∩ A + ∩ L ∩ A
m
m
∀ ; the set
[A,B] Real number range including (A) and (B), i.e. the closed
x: A ≤ x ≤ B
interval { }
[A,B[ Real number range including (A) but not (B), i.e.
x : A ≤
x < B
{ }