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 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics