Upper bounds on the quantifier depth for graph differentiation in first-order logic (Q6829577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7080195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the quantifier depth for graph differentiation in first-order logic |
scientific article; zbMATH DE number 7080195 |
Statements
Upper bounds on the quantifier depth for graph differentiation in first-order logic (English)
0 references
12 July 2019
0 references
first-order logic
0 references
counting quantifiers
0 references
Weisfeiler-Leman algorithm
0 references
color refinement
0 references
