{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:HG64CRWXE4OVIH67XJ6DR5AVWQ","short_pith_number":"pith:HG64CRWX","schema_version":"1.0","canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","source":{"kind":"arxiv","id":"0903.4051","version":1},"attestation_state":"computed","paper":{"title":"A proof of completeness for continuous first-order logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Arthur Paul Pedersen, Ita\\\"i Ben Yaacov (ICJ)","submitted_at":"2009-03-24T09:47:52Z","abstract_excerpt":"The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an \\emph{approximated} form of strong completeness, whereby $\\Sigma\\vDash\\varphi$ (if and) only if $\\Sigma\\vdash\\varphi\\dotminus 2^{-n}$ for all $n<\\omega$. This approximated form of strong completeness asserts that if $\\Sigma\\vDash\\va"},"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":"0903.4051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"dfacb962f3fab44e87a8097360f1568b7c941069b869f0a85a66b8f097a69ac3","abstract_canon_sha256":"0ef676a924acae2d929a86b546f1ee075769859ed727122d72947333f6bed593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:48.872880Z","signature_b64":"VP2ygeEQjFqY/QZTaF7E0RBN948o+e7YVmx9A+1+hc0P5YVlZORJxv/L8Q01yDI7OxZy0xVGmwcmIWwjFVNoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","last_reissued_at":"2026-05-18T02:59:48.871942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:48.871942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of completeness for continuous first-order logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Arthur Paul Pedersen, Ita\\\"i Ben Yaacov (ICJ)","submitted_at":"2009-03-24T09:47:52Z","abstract_excerpt":"The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an \\emph{approximated} form of strong completeness, whereby $\\Sigma\\vDash\\varphi$ (if and) only if $\\Sigma\\vdash\\varphi\\dotminus 2^{-n}$ for all $n<\\omega$. This approximated form of strong completeness asserts that if $\\Sigma\\vDash\\va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4051","kind":"arxiv","version":1},"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":"0903.4051","created_at":"2026-05-18T02:59:48.872111+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.4051v1","created_at":"2026-05-18T02:59:48.872111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4051","created_at":"2026-05-18T02:59:48.872111+00:00"},{"alias_kind":"pith_short_12","alias_value":"HG64CRWXE4OV","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"HG64CRWXE4OVIH67","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"HG64CRWX","created_at":"2026-05-18T12:25:59.703012+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/HG64CRWXE4OVIH67XJ6DR5AVWQ","json":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ.json","graph_json":"https://pith.science/api/pith-number/HG64CRWXE4OVIH67XJ6DR5AVWQ/graph.json","events_json":"https://pith.science/api/pith-number/HG64CRWXE4OVIH67XJ6DR5AVWQ/events.json","paper":"https://pith.science/paper/HG64CRWX"},"agent_actions":{"view_html":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ","download_json":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ.json","view_paper":"https://pith.science/paper/HG64CRWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.4051&json=true","fetch_graph":"https://pith.science/api/pith-number/HG64CRWXE4OVIH67XJ6DR5AVWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HG64CRWXE4OVIH67XJ6DR5AVWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/action/storage_attestation","attest_author":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/action/author_attestation","sign_citation":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/action/citation_signature","submit_replication":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/action/replication_record"}},"created_at":"2026-05-18T02:59:48.872111+00:00","updated_at":"2026-05-18T02:59:48.872111+00:00"}