The complexity of random ordered structures
- 20 February 2008
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 152 (1-3) , 174-179
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- How complex are random graphs in first order logic?Random Structures & Algorithms, 2004
- The Tenacity of Zero-One LawsThe Electronic Journal of Combinatorics, 2000
- A zero-one law for a random subsetRandom Structures & Algorithms, 1991
- Probabilities of first-order sentences about unary functionsTransactions of the American Mathematical Society, 1985