Ehrenfreuht game survey
Describing finite models. Finite versus infinite model theory
Trachtenbrot's theorem; further limitations
Descriptive Complexity; NP = Sigma-1-1.
Fixed point logics; FP=ptime
k-variable logics
0-1 laws: p = 1/2, variable p
generic structure, quantifier elimination
Back Home