Probabilities of sentences about two linear orderings
From MaRDI portal
[For the entire collection see Zbl 0753.00018.] Consider the class of all finite structures \(\langle n,\leq,\preceq\rangle\) consisting of an \(n\) element set with two linear orderings \(\leq\), \(\preceq\). This paper is concerned with the asymptotic properties of the collection of such structures satisfying a first order sentence \(\varphi\), and the extent to which these properties can be determined effectively.
Recommendations
- Probabilities on Models of Universal Sentences
- A logical approach to asymptotic combinatorics I. First order properties
- Probabilities in first—order logic of a unary function and a binary relation
- The computational complexity of asymptotic problems. I: Partial orders
- An undecidable problem in finite combinatorics
Cited in
(7)- Nonconvergence in the theory of random orders
- Probabilities on Models of Universal Sentences
- Logical limit laws for layered permutations and related structures
- Preface to the special issue of Permutation Patterns 2021 (PP2021)
- A logical limit law for \(231\)-avoiding permutations
- Logical limit laws for Mallows random permutations
- First-order convergence for 321-avoiding permutations
This page was built for publication: Probabilities of sentences about two linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035309)
