The first order definability of graphs: Upper bounds for quantifier depth (Q860411)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The first order definability of graphs: Upper bounds for quantifier depth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The first order definability of graphs: Upper bounds for quantifier depth |
scientific article |
Statements
The first order definability of graphs: Upper bounds for quantifier depth (English)
0 references
9 January 2007
0 references
graph definability
0 references
first-order logic
0 references
Ehrenfeucht game
0 references
0.8240687847137451
0 references
0.8059841394424438
0 references
0.7982566952705383
0 references
0.7971471548080444
0 references
