Abstract
There are sentences in the first order theory of partial orders for whom the limit probability of the sentence holding for the random partial order of dimension two does not exist. Furthermore there is no decision procedure that distinguishes those sentences which hold almost surely from those which hold almost never.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Foy and A. R. Woods (1989) Probability of sentences about two linear orders, Proceedings of the Workshop on Feasible Mathematics, M.S.I., Cornell.
B. A.Trachtembrot (1950) Impossibility of an algorithm for the decision problem on finite classes, Doklady Akademia Nauk. S.S.R. 70, 569–572.
P.Winkler (1985) Random orders, Order 1, 317–331.
P.Winkler and G.Brightwell (1989) A counterexample in the theory of random orders, Order 5, 363–368.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Rights and permissions
About this article
Cite this article
Spencer, J. Nonconvergence in the theory of random orders. Order 7, 341–348 (1990). https://doi.org/10.1007/BF00383198
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00383198