%0 Journal Article
%T Sufficient Conditions for Labelled 0-1 Laws
%A Stanley Burris
%A Karen Yeats
%J Discrete Mathematics & Theoretical Computer Science
%D 2008
%I Discrete Mathematics & Theoretical Computer Science
%X If F(x) = e G(x), where F(x) = ¦²f(n)x n and G(x) = ¦²g(n)x n, with 0¡Üg(n) = O(n ¦Èn /n!), ¦È¡Ê(0,1), and gcd(n: g(n) >0)=1, then f(n)= o(f(n-1)). This gives an answer to Compton's request in Question 8.3 [Compton 1987] for an ``easily verifiable sufficient condition'' to show that an adequate class of structures has a labelled first-order 0-1 law, namely it suffices to show that the labelled component count function is O(n ¦Èn) for some ¦È¡Ê(0,1). It also provides the means to recursively construct an adequate class of structures with a labelled 0-1 law but not an unlabelled 0-1 law, answering Compton's Question 8.4.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/618