Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic (Q4968381): Difference between revisions
From MaRDI portal
Item:Q4968381
Set profile property. |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic | |||
| Property / arXiv classification | |||
cs.LO | |||
| Property / arXiv classification: cs.LO / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.CC | |||
| Property / arXiv classification: cs.CC / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.CO | |||
| Property / arXiv classification: math.CO / rank | |||
Normal rank | |||
Revision as of 16:32, 19 April 2024
scientific article; zbMATH DE number 7080195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic |
scientific article; zbMATH DE number 7080195 |
Statements
12 July 2019
0 references
first-order logic
0 references
counting quantifiers
0 references
Weisfeiler-Leman algorithm
0 references
color refinement
0 references
cs.LO
0 references
cs.CC
0 references
math.CO
0 references
