Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884)

From MaRDI portal
Revision as of 23:34, 1 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6863498
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 6863498

    Statements

    Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (English)
    0 references
    0 references
    0 references
    23 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Weisfeiler-Leman algorithm
    0 references
    counting quantifiers
    0 references
    first-order logic
    0 references
    quantifier depth
    0 references