Locality and modular Ehrenfeucht-Fraïssé games

DOI10.1016/j.jal.2011.09.002zbMath1408.03020OpenAlexW1966961526MaRDI QIDQ420850

Achim Blumensath

Publication date: 23 May 2012

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2011.09.002

zbMATH Keywords

first-order logiclocalityEhrenfeucht-Fraïssé games

Mathematics Subject Classification ID

Model theory of finite structures (03C13)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The first order definability of graphs: Upper bounds for quantifier depth
• The computational complexity of logical theories
• On winning strategies in Ehrenfeucht-Fraïssé games
• Clique-width of countable graphs: A compactness property.
• On monadic NP vs monadic co-NP
• On winning Ehrenfeucht games and monadic NP
• A model-theoretic characterisation of clique width
• Computer Science Logic

This page was built for publication: Locality and modular Ehrenfeucht-Fraïssé games