MSO zero-one laws on random labelled acyclic graphs Original Research Article

We use Ehrenfeucht-type games to prove that Monadic Second Order logic admits labelled zero-one laws for random free trees, generating the complete almost sure theory. Our method will be to dissect random trees to get a picture of what almost all random free trees look like. We will use elementary (second moment) methods to obtain probability results.