Pages that link to "Item:Q420856"
From MaRDI portal
The following pages link to An optimal construction of Hanf sentences (Q420856):
Displaying 6 items.
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- (Q5002820) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing (Q6573776) (← links)
- On the satisfiability of local first-order logics with data (Q6597951) (← links)
