Pages that link to "Item:Q3066290"
From MaRDI portal
The following pages link to The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290):
Displaying 4 items.
- On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction (Q701734) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- The Exact Complexity of the First-Order Logic Definability Problem (Q5012557) (← links)