{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BXQMHMTAIAD4EC3J2N4KZS7TNM","short_pith_number":"pith:BXQMHMTA","schema_version":"1.0","canonical_sha256":"0de0c3b2604007c20b69d378accbf36b10d2996ab42403d4e7fc23f944f32006","source":{"kind":"arxiv","id":"1408.5314","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Decidability of the Necessity of Axioms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2014-08-22T15:02:44Z","abstract_excerpt":"A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\\phi$. In particular, one asks whether, given some system $T+\\psi$, $T$ alone suffices to prove $\\phi$. We show that this problem is undecidable unless $T+\\neg\\psi$ is decidable."},"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":"1408.5314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-22T15:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"977fef0f3e70cc7a906ca5b9b4a305598a1e6ceb62836ec5ad69ab81415b136d","abstract_canon_sha256":"c62681e211b9c0e2577d778fe76336ab0d6a47a7f90e0951d8993f266aef46b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.381012Z","signature_b64":"xP/lYiDwSvZuN6AYCw9rHG72jdE4vU+vBIT8xkiDcp1s3wMuIntgHKvoN97UoX5AtLZ36THyVF4GIk9QatfeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de0c3b2604007c20b69d378accbf36b10d2996ab42403d4e7fc23f944f32006","last_reissued_at":"2026-05-18T02:44:33.380518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.380518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Decidability of the Necessity of Axioms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2014-08-22T15:02:44Z","abstract_excerpt":"A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\\phi$. In particular, one asks whether, given some system $T+\\psi$, $T$ alone suffices to prove $\\phi$. We show that this problem is undecidable unless $T+\\neg\\psi$ is decidable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5314","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":"1408.5314","created_at":"2026-05-18T02:44:33.380600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5314v1","created_at":"2026-05-18T02:44:33.380600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5314","created_at":"2026-05-18T02:44:33.380600+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXQMHMTAIAD4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXQMHMTAIAD4EC3J","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXQMHMTA","created_at":"2026-05-18T12:28:22.404517+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/BXQMHMTAIAD4EC3J2N4KZS7TNM","json":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM.json","graph_json":"https://pith.science/api/pith-number/BXQMHMTAIAD4EC3J2N4KZS7TNM/graph.json","events_json":"https://pith.science/api/pith-number/BXQMHMTAIAD4EC3J2N4KZS7TNM/events.json","paper":"https://pith.science/paper/BXQMHMTA"},"agent_actions":{"view_html":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM","download_json":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM.json","view_paper":"https://pith.science/paper/BXQMHMTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5314&json=true","fetch_graph":"https://pith.science/api/pith-number/BXQMHMTAIAD4EC3J2N4KZS7TNM/graph.json","fetch_events":"https://pith.science/api/pith-number/BXQMHMTAIAD4EC3J2N4KZS7TNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM/action/storage_attestation","attest_author":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM/action/author_attestation","sign_citation":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM/action/citation_signature","submit_replication":"https://pith.science/pith/BXQMHMTAIAD4EC3J2N4KZS7TNM/action/replication_record"}},"created_at":"2026-05-18T02:44:33.380600+00:00","updated_at":"2026-05-18T02:44:33.380600+00:00"}