Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic |
No description defined |
Statements
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (English)
0 references
23 April 2018
0 references
Weisfeiler-Leman algorithm
0 references
counting quantifiers
0 references
first-order logic
0 references
quantifier depth
0 references
