The tenacity of zero-one laws

Joel H. Spencer, Katherine St. John

Research output: Contribution to journalArticle

Abstract

The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player ("Duplicator") in playing the Ehrenfeucht-Fraisse game, by bounding the numbers of moves Duplicator can play and win with probability 1-∈. We show that for random bit strings and random circular sequences of length n generated with a low probability (p ≪ n -1), the number of moves, T (n), is Θ(log 2 n). For random bit strings and circular sequences with isolated ones (n -1 ≪ p ≪ n -1/2), T (n) = O(min(log 2 np,-log 2 np 2)). For n -1/2 ≪ p and (1 - p) ≪ n -1/2, we show that T (n) = O(log* n) for random circular sequences, where log* n has the usual definition-the least number of times you iteratively apply the logarithm to get a value less than one.

Original languageEnglish (US)
Pages (from-to)1-14
Number of pages14
JournalElectronic Journal of Combinatorics
Volume8
Issue number2 R
StatePublished - 2001

Fingerprint

Zero-one Law
Tenacity
Ehrenfeucht-Fraïssé Games
Strings
Two-person Games
First-order Logic
Logarithm
Converge

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

The tenacity of zero-one laws. / Spencer, Joel H.; St. John, Katherine.

In: Electronic Journal of Combinatorics, Vol. 8, No. 2 R, 2001, p. 1-14.

Research output: Contribution to journalArticle

Spencer, JH & St. John, K 2001, 'The tenacity of zero-one laws', Electronic Journal of Combinatorics, vol. 8, no. 2 R, pp. 1-14.
Spencer, Joel H. ; St. John, Katherine. / The tenacity of zero-one laws. In: Electronic Journal of Combinatorics. 2001 ; Vol. 8, No. 2 R. pp. 1-14.
@article{fc37fc0e840f43268378bf649fcec627,
title = "The tenacity of zero-one laws",
abstract = "The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player ({"}Duplicator{"}) in playing the Ehrenfeucht-Fraisse game, by bounding the numbers of moves Duplicator can play and win with probability 1-∈. We show that for random bit strings and random circular sequences of length n generated with a low probability (p ≪ n -1), the number of moves, T ∈(n), is Θ(log 2 n). For random bit strings and circular sequences with isolated ones (n -1 ≪ p ≪ n -1/2), T ∈(n) = O(min(log 2 np,-log 2 np 2)). For n -1/2 ≪ p and (1 - p) ≪ n -1/2, we show that T ∈(n) = O(log* n) for random circular sequences, where log* n has the usual definition-the least number of times you iteratively apply the logarithm to get a value less than one.",
author = "Spencer, {Joel H.} and {St. John}, Katherine",
year = "2001",
language = "English (US)",
volume = "8",
pages = "1--14",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "2 R",

}

TY - JOUR

T1 - The tenacity of zero-one laws

AU - Spencer, Joel H.

AU - St. John, Katherine

PY - 2001

Y1 - 2001

N2 - The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player ("Duplicator") in playing the Ehrenfeucht-Fraisse game, by bounding the numbers of moves Duplicator can play and win with probability 1-∈. We show that for random bit strings and random circular sequences of length n generated with a low probability (p ≪ n -1), the number of moves, T ∈(n), is Θ(log 2 n). For random bit strings and circular sequences with isolated ones (n -1 ≪ p ≪ n -1/2), T ∈(n) = O(min(log 2 np,-log 2 np 2)). For n -1/2 ≪ p and (1 - p) ≪ n -1/2, we show that T ∈(n) = O(log* n) for random circular sequences, where log* n has the usual definition-the least number of times you iteratively apply the logarithm to get a value less than one.

AB - The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player ("Duplicator") in playing the Ehrenfeucht-Fraisse game, by bounding the numbers of moves Duplicator can play and win with probability 1-∈. We show that for random bit strings and random circular sequences of length n generated with a low probability (p ≪ n -1), the number of moves, T ∈(n), is Θ(log 2 n). For random bit strings and circular sequences with isolated ones (n -1 ≪ p ≪ n -1/2), T ∈(n) = O(min(log 2 np,-log 2 np 2)). For n -1/2 ≪ p and (1 - p) ≪ n -1/2, we show that T ∈(n) = O(log* n) for random circular sequences, where log* n has the usual definition-the least number of times you iteratively apply the logarithm to get a value less than one.

UR - http://www.scopus.com/inward/record.url?scp=4043067728&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4043067728&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:4043067728

VL - 8

SP - 1

EP - 14

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 2 R

ER -