{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6PSNABKWXVE6LMFPJX5PS4D7CV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"80100e725041ad136e6fbd49a7baa6d9a254b11da08f2fae1613c0e411dd5b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-02-10T07:06:59Z","title_canon_sha256":"3fe8ca01a7d565c8610b9c4a84464611db60423395364c8174226f7a6b044a46"},"schema_version":"1.0","source":{"id":"2602.09470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.09470","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.09470v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.09470","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"6PSNABKWXVE6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6PSNABKWXVE6LMFP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6PSNABKW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d26e7f358160299771be4ef56382ec23e92aaa05a3d5aace560d4a01cd6a197d","target":"graph","created_at":"2026-05-18T02:44:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For an ordinal λ>0, there exists a GL-consistent set of formulas having neither (Θ, I_λ)-model nor (Θ, τ_c +λ)-model when the language has cardinality (2^|λ|+ℵ₀)^+; λ-bouquet spaces yield strong completeness of GL for languages of cardinality λ."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The generalized Icard topologies I_λ and τ_c +λ are the right semantics for testing strong completeness; if other topologies or different model classes are intended, the failure result may not apply."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Strong completeness of GL fails for modal languages of size (2^|λ|+ℵ₀)^+ on generalized Icard topologies but holds for GL and GL.3 on λ-bouquet and ultralinear λ-bouquet spaces."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Provability logic GL fails strong completeness for modal languages of cardinality (2^|λ| + ℵ₀)^+ on ordinals with generalized Icard topologies."}],"snapshot_sha256":"f68d19a9f33ae2c016d9f118456c83ae47fe84ffec08b072e3ee0bbfaa85db10"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"For an ordinal $\\lambda>0$, we use the Erd\\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\\mathsf{GL}$ for modal languages of cardinality $(2^{|\\lambda|+\\aleph_0})^{+}$ with respect to models on ordinals equipped with the generalized Icard topologies $\\mathcal{I}_{\\lambda}$ and ${\\tau_{c}}_{+\\lambda}$. Specifically, we show that for such languages there exists a $\\mathsf{GL}$-consistent set of formulas having neither $(\\Theta, \\mathcal{I}_{\\lambda})$-model nor $(\\Theta, {\\tau_{c}}_{+\\lambda})$-model. We also introduce two kinds of natural classes of topological s","authors_text":"Grigorii Stepanov, Mohammad Golshani, Reihane Zoghifard","cross_cats":[],"headline":"Provability logic GL fails strong completeness for modal languages of cardinality (2^|λ| + ℵ₀)^+ on ordinals with generalized Icard topologies.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-02-10T07:06:59Z","title":"Strong Completeness of Provability Logic for Uncountable Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.09470","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T05:57:44.527062Z","id":"6eeb50e7-3f6d-46b8-8aed-352f4121fd3d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Strong completeness of GL fails for modal languages of size (2^|λ|+ℵ₀)^+ on generalized Icard topologies but holds for GL and GL.3 on λ-bouquet and ultralinear λ-bouquet spaces.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Provability logic GL fails strong completeness for modal languages of cardinality (2^|λ| + ℵ₀)^+ on ordinals with generalized Icard topologies.","strongest_claim":"For an ordinal λ>0, there exists a GL-consistent set of formulas having neither (Θ, I_λ)-model nor (Θ, τ_c +λ)-model when the language has cardinality (2^|λ|+ℵ₀)^+; λ-bouquet spaces yield strong completeness of GL for languages of cardinality λ.","weakest_assumption":"The generalized Icard topologies I_λ and τ_c +λ are the right semantics for testing strong completeness; if other topologies or different model classes are intended, the failure result may not apply."}},"verdict_id":"6eeb50e7-3f6d-46b8-8aed-352f4121fd3d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b7a73a3f4ddf81184177b0e6eb551bd2ef7e1fb13158db35361f959983c12a3","target":"record","created_at":"2026-05-18T02:44:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"80100e725041ad136e6fbd49a7baa6d9a254b11da08f2fae1613c0e411dd5b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-02-10T07:06:59Z","title_canon_sha256":"3fe8ca01a7d565c8610b9c4a84464611db60423395364c8174226f7a6b044a46"},"schema_version":"1.0","source":{"id":"2602.09470","kind":"arxiv","version":2}},"canonical_sha256":"f3e4d00556bd49e5b0af4dfaf9707f154715527a008ca2dd9157ce9fa64fab33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3e4d00556bd49e5b0af4dfaf9707f154715527a008ca2dd9157ce9fa64fab33","first_computed_at":"2026-05-18T02:44:31.240437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.240437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3jJ7Xeni2Q+mYB5j/tKx1SrH24EfghPvOl23+y3EqBnDmCWkXdbsnr+OBstb83aQkv6Yt0/ZXUCTOCepcgpDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.240956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.09470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b7a73a3f4ddf81184177b0e6eb551bd2ef7e1fb13158db35361f959983c12a3","sha256:d26e7f358160299771be4ef56382ec23e92aaa05a3d5aace560d4a01cd6a197d"],"state_sha256":"1dc4221dbfaf2b691644bf56980d9917683dc7afe06c78aa0b985cec10681e61"}