Sym bol
Mean ing
x
Ceil ing func tion of x (least inte ger not less than x)
x
Floor func tion of x (great est inte ger not exceed ing x)
⇒
Log i cal con nec tive — If … … then … …
∨
For every
∃
There exists
≡
Equiv a lence of pred i cate for mu lae
χ A
Char ac ter is tic func tion of set A
Z x
( )
Zero func tion
S x
( )
Suc ces sor func tion
p x
i
n ( )
Pro jec tor Func tion
( , , , , )
Q
q F
Σ δ 0
Finite autom a ton
( , , , , , )
Q
q
Σ ∆ δ λ 0
Moore-Mealey Machine
( , , , )
V
P S
N Σ
Gram mar
( , , , , , , )
Q
q b F
Σ Γ δ 0
Turing machine
O f n
( ( ))
Set of func tions whose growth r is order f(n).
N
Set of Nat u ral num bers
Z
Set of Inte gers
Q
Set of Ratio nal Num bers
R
Set of Real Num bers
viii
Nota tions
Mean ing
x
Ceil ing func tion of x (least inte ger not less than x)
x
Floor func tion of x (great est inte ger not exceed ing x)
⇒
Log i cal con nec tive — If … … then … …
∨
For every
∃
There exists
≡
Equiv a lence of pred i cate for mu lae
χ A
Char ac ter is tic func tion of set A
Z x
( )
Zero func tion
S x
( )
Suc ces sor func tion
p x
i
n ( )
Pro jec tor Func tion
( , , , , )
Q
q F
Σ δ 0
Finite autom a ton
( , , , , , )
Q
q
Σ ∆ δ λ 0
Moore-Mealey Machine
( , , , )
V
P S
N Σ
Gram mar
( , , , , , , )
Q
q b F
Σ Γ δ 0
Turing machine
O f n
( ( ))
Set of func tions whose growth r is order f(n).
N
Set of Nat u ral num bers
Z
Set of Inte gers
Q
Set of Ratio nal Num bers
R
Set of Real Num bers
viii
Nota tions