•Motivation: random graphs
•
•0/1 law for FO proven by Glebskii et al., then rediscovered by Fagin (and with nicer proof)
–Only for constant probability distribution
•Later extended to other logics, and other probability distributions
•
•Why we care: applications in degrees of belief, probabilistic databases, etc.