{"paper":{"title":"A New Ehrenfeucht-Fra\\\"iss\\'e Game for Dependence Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Joni Puljuj\\\"arvi, Jouko V\\\"a\\\"an\\\"anen","submitted_at":"2026-05-30T16:59:55Z","abstract_excerpt":"We define a new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic. The previously known rendition of such a game was based on moves that are teams. Since teams can be massive, making team moves may be quite complicated. To remedy this, our new Ehrenfeucht-Fra\\\"iss\\'e game for dependence logic has only moves that consist of single elements, as in the classical Ehrenfeucht-Fra\\\"iss\\'e game of first order logic. A new feature of the game is that a player can declare that their move is made on the basis of certain previous moves only and thereby in a sense independent of other moves. We show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00812","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00812/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}