Probabilities of sentences about two linear orderings
Consider the class of all finite structures 〈n, ≤, ≺ 〉 consisting of an n element set with two linear orderings ≤, ≺. This paper is concerned with the asymptotic properties of the collection of such structures satisfying a first order sentence ϕ and the extent to which these properties can be determined effectively.
KeywordsLinear Ordering Cyclic Permutation Black Point Successor Function Isomorphism Type
Unable to display preview. Download preview PDF.
- Bennett, J.H. On spectra. Ph. D. thesis, Princeton, 1962.Google Scholar
- Spencer, J. Nonconvergence in the theory of orders. To appear.Google Scholar
- Woods,A.R. Some problems in logic and number theory, and their connections. Ph.D. thesis, University of Manchester, 1981.Google Scholar