scientific article; zbMATH DE number 1059242

zbMATH Open0880.68058MaRDI QIDQ4353557FDOQ4353557

Authors: Ronald Fagin 

Publication date: 10 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• On winning Ehrenfeucht games and monadic NP
• On winning strategies in Ehrenfeucht-Fraïssé games
• On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
• scientific article; zbMATH DE number 1136084

zbMATH Keywords

inexpressibilityEhrenfeucht-Fraïssé-games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Cited In (9)

• Verifiable properties of database transactions
• How to win a game with features
• Locality and modular Ehrenfeucht-Fraïssé games
• Game-based notions of locality over finite models
• Title not available (Why is that?)
• Existential MSO over two successors is strictly weaker than over linear orders
• An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
• Comparing the Power of Games on Graphs
• Solutions and query rewriting in data exchange

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353557)