{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VNRA5X42UZ2SEPMDWFSGAUKTDZ","short_pith_number":"pith:VNRA5X42","schema_version":"1.0","canonical_sha256":"ab620edf9aa675223d83b1646051531e7c53df0e58e266a7c2bad504fddc475c","source":{"kind":"arxiv","id":"1904.07691","version":2},"attestation_state":"computed","paper":{"title":"Completeness for Game Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Clemens Kupke, Helle Hvid Hansen, Johannes Marti, Sebastian Enqvist, Yde Venema","submitted_at":"2019-04-16T14:09:40Z","abstract_excerpt":"Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs to games is mirrored by moving from Kripke models to monotone neighbourhood models. Parikh proposed a natural PDL-style Hilbert system which was easily proved to be sound, but its completeness has thus far remained an open problem.\n  In this paper, we introduce a cut-free sequent calculus for game logic, and two cut-free sequent calculi that manipulate anno"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.07691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-16T14:09:40Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"5fb606f33d1037649d78dc6b958293330219082f7bddcb86c7f2bb455c3cd023","abstract_canon_sha256":"77f023bf508a8a2760bda57660d3d286651de4cd521cde9c8a5b21fefe8fdffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:24.818431Z","signature_b64":"CknFRKLCC1l6QQRXlSMJ4+5jvGz/uVdyfqwyxo9GHz0F3ynLadlIlGRQG6MqOHtfYNKW4psJjKcD6P0F3hArAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab620edf9aa675223d83b1646051531e7c53df0e58e266a7c2bad504fddc475c","last_reissued_at":"2026-05-17T23:47:24.817990Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:24.817990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completeness for Game Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Clemens Kupke, Helle Hvid Hansen, Johannes Marti, Sebastian Enqvist, Yde Venema","submitted_at":"2019-04-16T14:09:40Z","abstract_excerpt":"Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs to games is mirrored by moving from Kripke models to monotone neighbourhood models. Parikh proposed a natural PDL-style Hilbert system which was easily proved to be sound, but its completeness has thus far remained an open problem.\n  In this paper, we introduce a cut-free sequent calculus for game logic, and two cut-free sequent calculi that manipulate anno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07691","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.07691","created_at":"2026-05-17T23:47:24.818057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07691v2","created_at":"2026-05-17T23:47:24.818057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07691","created_at":"2026-05-17T23:47:24.818057+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNRA5X42UZ2S","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNRA5X42UZ2SEPMD","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNRA5X42","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02860","citing_title":"Truly Concurrent Bisimilarities are Game Equivalent","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ","json":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ.json","graph_json":"https://pith.science/api/pith-number/VNRA5X42UZ2SEPMDWFSGAUKTDZ/graph.json","events_json":"https://pith.science/api/pith-number/VNRA5X42UZ2SEPMDWFSGAUKTDZ/events.json","paper":"https://pith.science/paper/VNRA5X42"},"agent_actions":{"view_html":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ","download_json":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ.json","view_paper":"https://pith.science/paper/VNRA5X42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07691&json=true","fetch_graph":"https://pith.science/api/pith-number/VNRA5X42UZ2SEPMDWFSGAUKTDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VNRA5X42UZ2SEPMDWFSGAUKTDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ/action/storage_attestation","attest_author":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ/action/author_attestation","sign_citation":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ/action/citation_signature","submit_replication":"https://pith.science/pith/VNRA5X42UZ2SEPMDWFSGAUKTDZ/action/replication_record"}},"created_at":"2026-05-17T23:47:24.818057+00:00","updated_at":"2026-05-17T23:47:24.818057+00:00"}