{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XOETU5ZZKGLJ6VCUMNET5WJTI5","short_pith_number":"pith:XOETU5ZZ","schema_version":"1.0","canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","source":{"kind":"arxiv","id":"1810.09142","version":2},"attestation_state":"computed","paper":{"title":"Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Mikhail Rybakov","submitted_at":"2018-10-22T08:52:23Z","abstract_excerpt":"We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiabili"},"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":"1810.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-22T08:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"e9f0fd4efda788d742a8b6f3aa638f5055cdb7645a242e481e32aba0334cca3e","abstract_canon_sha256":"cc5a92a7c321cad06fab224824dcea0f9c8923f590f1ba728f17ff7dfb333782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:54.466335Z","signature_b64":"4F+CckN0IJqcCzIppNPFlufCiY49Mh6EiG61d3c5fGu/pS35jf6AFri9V9LEktLVBzz5c27TnTwQTvVGD/j8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb893a773951969f545463493ed933475053e9dc2c6ee0af8aab2cb53ccaa715","last_reissued_at":"2026-05-17T23:55:54.465817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:54.465817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Mikhail Rybakov","submitted_at":"2018-10-22T08:52:23Z","abstract_excerpt":"We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09142","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":"1810.09142","created_at":"2026-05-17T23:55:54.465918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09142v2","created_at":"2026-05-17T23:55:54.465918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09142","created_at":"2026-05-17T23:55:54.465918+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOETU5ZZKGLJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOETU5ZZKGLJ6VCU","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOETU5ZZ","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5","json":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5.json","graph_json":"https://pith.science/api/pith-number/XOETU5ZZKGLJ6VCUMNET5WJTI5/graph.json","events_json":"https://pith.science/api/pith-number/XOETU5ZZKGLJ6VCUMNET5WJTI5/events.json","paper":"https://pith.science/paper/XOETU5ZZ"},"agent_actions":{"view_html":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5","download_json":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5.json","view_paper":"https://pith.science/paper/XOETU5ZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09142&json=true","fetch_graph":"https://pith.science/api/pith-number/XOETU5ZZKGLJ6VCUMNET5WJTI5/graph.json","fetch_events":"https://pith.science/api/pith-number/XOETU5ZZKGLJ6VCUMNET5WJTI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/action/storage_attestation","attest_author":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/action/author_attestation","sign_citation":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/action/citation_signature","submit_replication":"https://pith.science/pith/XOETU5ZZKGLJ6VCUMNET5WJTI5/action/replication_record"}},"created_at":"2026-05-17T23:55:54.465918+00:00","updated_at":"2026-05-17T23:55:54.465918+00:00"}