{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7MPNBYELVZXOSSXFCNHUIVKUD","short_pith_number":"pith:X7MPNBYE","schema_version":"1.0","canonical_sha256":"bfd8f687045d73774a57289a7a22aaa0d8fa91b30df111e23a53928af34ded1d","source":{"kind":"arxiv","id":"1901.06900","version":2},"attestation_state":"computed","paper":{"title":"MSO+nabla is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Edon Kelmendi, Micha{\\l} Skrzypczak, Miko{\\l}aj Boja\\'nczyk","submitted_at":"2019-01-21T12:13:48Z","abstract_excerpt":"This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying ``almost surely a branch {\\pi} \\in {0, 1}^w satisfies a formula {\\phi}({\\pi})''. This logic was introduced by Michalewski and Mio; we call it MSO+nabla following notation of Shelah and Lehmann. The logic MSO+nabla subsumes many qualitative probabilistic formalisms, including qualitative probabilistic CTL, probabilistic LTL, or parity tree automata with probabilistic acceptance conditions. We show that it is undecidable to check if a given sentence of MSO+nabla is true in the "},"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":"1901.06900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-21T12:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"1e58943657182dd3f1126e9cfd24a254f7812268c17231ea85de059925108f9a","abstract_canon_sha256":"b4be98fa1d01ad9896e5805159fd62590fcbe340105abb9e0f7604c062d55562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.813584Z","signature_b64":"PTzKXLnwCxtUcZNcZ81pDuZBGza1t/U+8EVRdR4PcVxTHFRnnmbxb7ai8UD8BXwCtRZtF5a4piIrxhsz80JzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfd8f687045d73774a57289a7a22aaa0d8fa91b30df111e23a53928af34ded1d","last_reissued_at":"2026-05-17T23:47:35.813123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.813123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MSO+nabla is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Edon Kelmendi, Micha{\\l} Skrzypczak, Miko{\\l}aj Boja\\'nczyk","submitted_at":"2019-01-21T12:13:48Z","abstract_excerpt":"This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying ``almost surely a branch {\\pi} \\in {0, 1}^w satisfies a formula {\\phi}({\\pi})''. This logic was introduced by Michalewski and Mio; we call it MSO+nabla following notation of Shelah and Lehmann. The logic MSO+nabla subsumes many qualitative probabilistic formalisms, including qualitative probabilistic CTL, probabilistic LTL, or parity tree automata with probabilistic acceptance conditions. We show that it is undecidable to check if a given sentence of MSO+nabla is true in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06900","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":"1901.06900","created_at":"2026-05-17T23:47:35.813183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06900v2","created_at":"2026-05-17T23:47:35.813183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06900","created_at":"2026-05-17T23:47:35.813183+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7MPNBYELVZX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7MPNBYELVZXOSSX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7MPNBYE","created_at":"2026-05-18T12:33:33.725879+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/X7MPNBYELVZXOSSXFCNHUIVKUD","json":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD.json","graph_json":"https://pith.science/api/pith-number/X7MPNBYELVZXOSSXFCNHUIVKUD/graph.json","events_json":"https://pith.science/api/pith-number/X7MPNBYELVZXOSSXFCNHUIVKUD/events.json","paper":"https://pith.science/paper/X7MPNBYE"},"agent_actions":{"view_html":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD","download_json":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD.json","view_paper":"https://pith.science/paper/X7MPNBYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06900&json=true","fetch_graph":"https://pith.science/api/pith-number/X7MPNBYELVZXOSSXFCNHUIVKUD/graph.json","fetch_events":"https://pith.science/api/pith-number/X7MPNBYELVZXOSSXFCNHUIVKUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD/action/storage_attestation","attest_author":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD/action/author_attestation","sign_citation":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD/action/citation_signature","submit_replication":"https://pith.science/pith/X7MPNBYELVZXOSSXFCNHUIVKUD/action/replication_record"}},"created_at":"2026-05-17T23:47:35.813183+00:00","updated_at":"2026-05-17T23:47:35.813183+00:00"}