Terms
Meaning
Section
Formal Logic
"--p
Not p
2.1
pAq
p and q
2.1
pvq
p or q
2.1
p
q
p implies q
2.1
p
q
p is equivalent to q
2.1
S
X
S logically implies X
2.3.3
P 3 AKP
Conjecture about complexity
2.5.6
(Vx)P(x)
For all x, P(x)
2.7.2
(3x)P(x)
There exists an x such that P(x)
2.7.2
(VxE V)P(x)
For all X EV, P(x)
2.7.3
(3x E V)P(x)
There exists an x E V such that P(x)
2.7.3
A[i . .j]
Array with elements Ail, ... , A[j]
2.7.3
1
Sheffer stroke
2.4
V
Exclusive or
2.4
4,
Pierce arrow
2.9
(x, y) E R or xRy
x is R-related to y
3.1
R-1
The inverse of the relation R
3.2.1
RoS
Composition of relations R and S
3.2.2
R+
U°° Ri
3.4.4
R*
URO R'
3.4.4
n =- m(modp)
n - m = kp for some k E N
3.6
Idx
Identity relation
3.1
Lex
Less than or equal relation
3.1
Gtx
Greater than relation
3.1
Gex
Greater than or equal relation
3.1
[x]
Equivalence class of x
3.6
min
m divides n
3.8.1
R D. S
Equijoin of relations R and S
3.10.2