{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7NXLJKKKPZAQVMUKCCH56BN63Y","short_pith_number":"pith:7NXLJKKK","schema_version":"1.0","canonical_sha256":"fb6eb4a94a7e410ab28a108fdf05bede3104e3ee54a6226155cc43915251958d","source":{"kind":"arxiv","id":"1805.00381","version":1},"attestation_state":"computed","paper":{"title":"Axiomatizing provable $n$-provability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Evgeny Kolmakov, Lev Beklemishev","submitted_at":"2018-05-01T15:04:02Z","abstract_excerpt":"A formula $\\phi$ is called \\emph{$n$-provable} in a formal arithmetical theory $S$ if $\\phi$ is provable in $S$ together with all true arithmetical $\\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable formulas, for a fixed $n>0$, is not recursively enumerable, the set of formulas $\\phi$ whose $n$-provability is provable in a given r.e.\\ metatheory $T$ is r.e. This set is deductively closed and will be, in general, an extension of $S$. We prove that these theories can be naturally axiomatized in terms of progressions of iterated local reflection principle"},"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":"1805.00381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-05-01T15:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"9b23c21143fee3c56627dff9b496c5708f19455e25e66e5cfb041a40bb267947","abstract_canon_sha256":"8a4fd3a686e6d3507916b480bf87ba91e1b661ee0a8104d58703fd550d9a02b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.820001Z","signature_b64":"2sl2IKj7sydYZq2wcJvXcLYTE5YNBpXpeV5o/+s8C9WCmX7fZ/y2V+v9n5nJYsaDk/0ozicnKHcq6GFsh+5yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6eb4a94a7e410ab28a108fdf05bede3104e3ee54a6226155cc43915251958d","last_reissued_at":"2026-05-17T23:40:41.819371Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.819371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Axiomatizing provable $n$-provability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Evgeny Kolmakov, Lev Beklemishev","submitted_at":"2018-05-01T15:04:02Z","abstract_excerpt":"A formula $\\phi$ is called \\emph{$n$-provable} in a formal arithmetical theory $S$ if $\\phi$ is provable in $S$ together with all true arithmetical $\\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable formulas, for a fixed $n>0$, is not recursively enumerable, the set of formulas $\\phi$ whose $n$-provability is provable in a given r.e.\\ metatheory $T$ is r.e. This set is deductively closed and will be, in general, an extension of $S$. We prove that these theories can be naturally axiomatized in terms of progressions of iterated local reflection principle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00381","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":"1805.00381","created_at":"2026-05-17T23:40:41.819488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00381v1","created_at":"2026-05-17T23:40:41.819488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00381","created_at":"2026-05-17T23:40:41.819488+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NXLJKKKPZAQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NXLJKKKPZAQVMUK","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NXLJKKK","created_at":"2026-05-18T12:32:11.075285+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/7NXLJKKKPZAQVMUKCCH56BN63Y","json":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y.json","graph_json":"https://pith.science/api/pith-number/7NXLJKKKPZAQVMUKCCH56BN63Y/graph.json","events_json":"https://pith.science/api/pith-number/7NXLJKKKPZAQVMUKCCH56BN63Y/events.json","paper":"https://pith.science/paper/7NXLJKKK"},"agent_actions":{"view_html":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y","download_json":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y.json","view_paper":"https://pith.science/paper/7NXLJKKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00381&json=true","fetch_graph":"https://pith.science/api/pith-number/7NXLJKKKPZAQVMUKCCH56BN63Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7NXLJKKKPZAQVMUKCCH56BN63Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y/action/storage_attestation","attest_author":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y/action/author_attestation","sign_citation":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y/action/citation_signature","submit_replication":"https://pith.science/pith/7NXLJKKKPZAQVMUKCCH56BN63Y/action/replication_record"}},"created_at":"2026-05-17T23:40:41.819488+00:00","updated_at":"2026-05-17T23:40:41.819488+00:00"}