A counterexample in the theory of random orders (Q1121295): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124802645, #quickstatements; #temporary_batch_1712286835472 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The computational complexity of asymptotic problems. I: Partial orders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partially Ordered Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random orders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectedness and diameter for random orders of fixed dimension / rank | |||
Normal rank | |||
Revision as of 15:33, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counterexample in the theory of random orders |
scientific article |
Statements
A counterexample in the theory of random orders (English)
0 references
1989
0 references
The main result of this paper is that the 0-1 law fails in random orders of fixed dimension k, \(k\geq 3\). In particular, an example of a first- order sentence \(\Phi\) in the language of partial orders is given which cannot have limiting probability 0 or 1 among random orders of dimension 3.
0 references
0-1 law
0 references
random orders
0 references
first-order sentence
0 references
