4
Summary on L
w
1
w
•
Motivation
•
Any
algorithmic computation that applies FO formulas
is expressible in L
w
1
w
•
Relational machines
•
While-programs with statements R :=
f
•
Fixpoint logics: LFP, IFP, PFP, etc, etc
•
•
Consequence
: cannot express EVEN, HAMILTONEAN