{"id":"https://openalex.org/W2051561433","doi":"https://doi.org/10.2307/2272163","title":"A theorem on shortening the length of proof in formal systems of arithmetic","display_name":"A theorem on shortening the length of proof in formal systems of arithmetic","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W2051561433","doi":"https://doi.org/10.2307/2272163","mag":"2051561433"},"language":"en","primary_location":{"id":"doi:10.2307/2272163","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272163","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074071182","display_name":"Robert A. Di Paola","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert A. di Paola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5074071182"],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.5324,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64029851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"3","first_page":"398","last_page":"400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7857014536857605},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6607462167739868},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.6496376395225525},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5750758647918701},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5047544240951538},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48072412610054016},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.4118833839893341},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.2755015194416046},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.11568468809127808}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7857014536857605},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6607462167739868},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.6496376395225525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5750758647918701},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5047544240951538},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48072412610054016},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.4118833839893341},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2755015194416046},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.11568468809127808},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2272163","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272163","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1571003765","https://openalex.org/W1973037977","https://openalex.org/W2033664708","https://openalex.org/W2046805782"],"related_works":["https://openalex.org/W1658358494","https://openalex.org/W2156864480","https://openalex.org/W3099922764","https://openalex.org/W1563786920","https://openalex.org/W2072809974","https://openalex.org/W3209732136","https://openalex.org/W4288634121","https://openalex.org/W4297670065","https://openalex.org/W1618267488","https://openalex.org/W2909826889"],"abstract_inverted_index":{"This":[0],"note":[1],"is":[2,51,74,97,109,120,167,173],"concerned":[3],"with":[4,79],"an":[5,43,136],"aspect":[6],"of":[7,10,12,30,32,63,88,129,141,161,171,184,188],"the":[8,27,35,52,71,104,110,115,121,130,145,157,162,182,185],"length":[9,29,183],"proof":[11,31,187],"formulas":[13,33,151],"in":[14,34,47,68,83,94,125,179,189],"recursively":[15],"enumerable":[16],"theories":[17,36],"T":[18,37,48,56,73],"adequate":[19],"for":[20],"recursive":[21,86],"arithmetic.":[22],"In":[23,156],"particular,":[24],"we":[25,134],"consider":[26],"relative":[28],"and":[38,49,93],"T(S),":[39],"where":[40],"F":[41,166],"represents":[42],"r.e.":[44,77,123,131],"set":[45,124],"A":[46],"T(S)":[50],"theory":[53,78],"obtained":[54],"from":[55],"by":[57],"adjunction,":[58],"as":[59],"a":[60,64,75,98,126,137,168,174],"new":[61],"axiom,":[62],"sentence":[65],"S":[66],"undecidable":[67],"T.":[69,190],"Throughout":[70],"sequel":[72],"consistent,":[76],"standard":[80,127],"formalization":[81],"[7]":[82],"which":[84,95],"all":[85,150],"functions":[87],"one":[89],"variable":[90],"are":[91,152],"definable,":[92],"there":[96],"binary":[99],"formula":[100,170],"x":[101],"\u2264":[102],"satisfying":[103,144],"well-known":[105],"conditions":[106],"[7]:":[107],"Here":[108],"constant":[111],"term":[112],"corresponding":[113],"to":[114],"natural":[116,175],"number":[117,176],"n.":[118],"Wn":[119],"nth":[122],"enumeration":[128],"sets.":[132],"Also,":[133],"assume":[135],"priori":[138],"G\u00f6del":[139],"numbering":[140],"our":[142],"formalism":[143],"usual":[146],"conditions,":[147],"so":[148],"that":[149,177],"numbers":[153],"ab":[154],"initio.":[155],"more":[158],"common":[159],"applications":[160],"theorem":[163],"below,":[164],"if":[165],"k-ary":[169],"T,":[172],"measures":[178],"some":[180],"way":[181],"shortest":[186]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}