Logical limit laws for layered permutations and related structures

Abstract

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

References in corpus (1)

• Logical properties of random graphs from small addable classes

Cited by in corpus (1)

• A logical limit law for $231$-avoiding permutations