English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We introduce differential games for FO logic of graphs, a variant ofEhrenfeucht-Fra\"{i}ss\'e games in which the game is played on only one graphand the moves of both players restricted. We prove that, in a certain sense,these games are strong enough to capture essential information about graphsfrom graph classes which are interpretable in nowhere dense graph classes.This, together with the newly introduced notion of differential locality andthe fact that the restriction of possible moves by the players makes it easy todecide the winner of the game in some cases, leads to a new approach to the FOmodel checking problem on interpretations of nowhere dense graph classes.

Differential games, locality and model checking for FO logic of graphs