•How does the “random graph” R look like
?
•
•Does second order logic SO have a 0/1 law ?
•
•“Almost everywhere equivalence”. Two logics L, L’ are a.e. equivalent if forall f 2 L 9 f’ in L’ s.t. m(f $ f’) = 1.
–The following are a.e. equivalent: FO, Lw1w, LFP, IFP, PFP