Pages that link to "Item:Q5436997"
From MaRDI portal
The following pages link to Games on Trees and Syntactical Complexity of Formulas (Q5436997):
Displaying 8 items.
- On n-equivalence of binary trees (Q579237) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- Tree canonization and transitive closure (Q1854332) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- On Some Applications of Games for Härtig Quantifier (Q3773858) (← links)
- An <i>n</i> ! lower bound on formula size (Q5267432) (← links)