{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NHN35MN77JKHDZZIW73NYJHMGR","short_pith_number":"pith:NHN35MN7","schema_version":"1.0","canonical_sha256":"69dbbeb1bffa5471e728b7f6dc24ec344fff533ebd4fe1fbbf477f48f302f095","source":{"kind":"arxiv","id":"1502.04578","version":2},"attestation_state":"computed","paper":{"title":"The MSO+U theory of (N, <) is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk, Pawe{\\l} Parys, Szymon Toru\\'nczyk","submitted_at":"2015-02-16T15:35:39Z","abstract_excerpt":"We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the logic is undecidable on infinite words, i.e. the MSO+U theory of (N,<) is undecidable. This settles an open problem about the logic, and improves a previous undecidability result, which used infinite trees and additional axioms from set theory."},"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":"1502.04578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-16T15:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"ed8de634b2b44b48252636e0200beeb2b9a38631958609fa37a83a6e589fdc28","abstract_canon_sha256":"d7b3377a3823f8dfba44d6b40abd35c7004f1e84f4113cf00c3e63a2a641804c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:58.500160Z","signature_b64":"A5oWNg07uVV9kWYtpJuisEf44se5zxCY2WAHiQyp0dPeJ+BQ65UDwPQoXyszw73fBk2UZKBOH4Jf8PZq6P90AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69dbbeb1bffa5471e728b7f6dc24ec344fff533ebd4fe1fbbf477f48f302f095","last_reissued_at":"2026-05-18T02:26:58.499772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:58.499772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The MSO+U theory of (N, <) is undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk, Pawe{\\l} Parys, Szymon Toru\\'nczyk","submitted_at":"2015-02-16T15:35:39Z","abstract_excerpt":"We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the logic is undecidable on infinite words, i.e. the MSO+U theory of (N,<) is undecidable. This settles an open problem about the logic, and improves a previous undecidability result, which used infinite trees and additional axioms from set theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04578","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":"1502.04578","created_at":"2026-05-18T02:26:58.499828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04578v2","created_at":"2026-05-18T02:26:58.499828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04578","created_at":"2026-05-18T02:26:58.499828+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHN35MN77JKH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHN35MN77JKHDZZI","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHN35MN7","created_at":"2026-05-18T12:29:32.376354+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/NHN35MN77JKHDZZIW73NYJHMGR","json":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR.json","graph_json":"https://pith.science/api/pith-number/NHN35MN77JKHDZZIW73NYJHMGR/graph.json","events_json":"https://pith.science/api/pith-number/NHN35MN77JKHDZZIW73NYJHMGR/events.json","paper":"https://pith.science/paper/NHN35MN7"},"agent_actions":{"view_html":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR","download_json":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR.json","view_paper":"https://pith.science/paper/NHN35MN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04578&json=true","fetch_graph":"https://pith.science/api/pith-number/NHN35MN77JKHDZZIW73NYJHMGR/graph.json","fetch_events":"https://pith.science/api/pith-number/NHN35MN77JKHDZZIW73NYJHMGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR/action/storage_attestation","attest_author":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR/action/author_attestation","sign_citation":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR/action/citation_signature","submit_replication":"https://pith.science/pith/NHN35MN77JKHDZZIW73NYJHMGR/action/replication_record"}},"created_at":"2026-05-18T02:26:58.499828+00:00","updated_at":"2026-05-18T02:26:58.499828+00:00"}