Logical limit laws for layered permutations and related structures
Samuel Braunfeld, Matthew Kukla
TL;DR
This paper demonstrates that various classes of ordered structures, including convex linear orders, layered permutations, and compositions, follow first-order logical limit laws, revealing their asymptotic logical properties.
Contribution
It establishes first-order logical limit laws for multiple classes of ordered structures, expanding understanding of their asymptotic logical behavior.
Findings
Convex linear orders satisfy first-order limit laws.
Layered permutations follow first-order limit laws.
Compositions admit first-order logical limit laws.
Abstract
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.