Pages that link to "Item:Q4635884"
From MaRDI portal
The following pages link to Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884):
Displaying 6 items.
- The limits of decidability for first order logic on CPDA graphs (Q2904796) (← links)
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (Q4635847) (← links)
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps (Q4635882) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- (Q4968381) (redirect page) (← links)
- (Q5091279) (← links)