Abstract
Employing an analysis of the Ehrenfeucht game a partial characterization of the threshold spectra for first-order sentences in the theory of graphs is given.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 235-252 |
| Number of pages | 18 |
| Journal | Discrete Applied Mathematics |
| Volume | 30 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - Feb 28 1991 |
Fingerprint
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science
Cite this
Threshold spectra via the Ehrenfeucht game. / Spencer, Joel.
In: Discrete Applied Mathematics, Vol. 30, No. 2-3, 28.02.1991, p. 235-252.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Threshold spectra via the Ehrenfeucht game
AU - Spencer, Joel
PY - 1991/2/28
Y1 - 1991/2/28
N2 - Employing an analysis of the Ehrenfeucht game a partial characterization of the threshold spectra for first-order sentences in the theory of graphs is given.
AB - Employing an analysis of the Ehrenfeucht game a partial characterization of the threshold spectra for first-order sentences in the theory of graphs is given.
UR - http://www.scopus.com/inward/record.url?scp=4043126985&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4043126985&partnerID=8YFLogxK
U2 - 10.1016/0166-218X(91)90048-2
DO - 10.1016/0166-218X(91)90048-2
M3 - Article
VL - 30
SP - 235
EP - 252
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
SN - 0166-218X
IS - 2-3
ER -