{"id":"https://openalex.org/W2116278910","doi":"https://doi.org/10.2178/jsl/1264433918","title":"On the complexity of G\u00f6del's proof predicate","display_name":"On the complexity of G\u00f6del's proof predicate","publication_year":2010,"publication_date":"2010-01-25","ids":{"openalex":"https://openalex.org/W2116278910","doi":"https://doi.org/10.2178/jsl/1264433918","mag":"2116278910"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1264433918","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1264433918","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":"The 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/A5101621254","display_name":"Yijia Chen","orcid":"https://orcid.org/0009-0006-6986-6736"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yijia Chen","raw_affiliation_strings":["Basics, Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, China, E-mail:","Basics, Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, China, E-mail: yijia.chen@cs.sjtu.edu.cn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Basics, Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, China, E-mail:","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Basics, Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, China, E-mail: yijia.chen@cs.sjtu.edu.cn","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113696666","display_name":"J\u00f6rg Flum","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Flum","raw_affiliation_strings":["Abteilung f\u00fcr Mathematische Logik, Universit\u00e4t Freiburg, 79104 Freiburg, Germany, E-mail:","Abteilung f\u00fcr Mathematische Logik, Universit\u00e4t Freiburg, 79104 Freiburg, Germany, E-mail: joerg.flum@math.uni-freiburg.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Abteilung f\u00fcr Mathematische Logik, Universit\u00e4t Freiburg, 79104 Freiburg, Germany, E-mail:","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Abteilung f\u00fcr Mathematische Logik, Universit\u00e4t Freiburg, 79104 Freiburg, Germany, E-mail: joerg.flum@math.uni-freiburg.de","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5973,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83732102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"75","issue":"1","first_page":"239","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9976000189781189,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8655291795730591},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.734897792339325},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6811673641204834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6548332571983337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5642499327659607},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5255319476127625},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.5005137920379639},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.49161297082901},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44319936633110046},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42544227838516235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2129441797733307}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8655291795730591},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.734897792339325},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6811673641204834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6548332571983337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5642499327659607},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5255319476127625},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.5005137920379639},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.49161297082901},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44319936633110046},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42544227838516235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2129441797733307},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2178/jsl/1264433918","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1264433918","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":"The Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.570.751","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://basics.sjtu.edu.cn/~chen/papers/goedel.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.865.9217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.865.9217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Yijia_Chen/publication/220315774_On_the_complexity_of_Gdel%27s_proof_predicate/links/0deec524b80501a711000000.pdf","raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1264433918","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1264433918","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1537470063","https://openalex.org/W1570425181","https://openalex.org/W2064811181","https://openalex.org/W2085283873","https://openalex.org/W2116887008","https://openalex.org/W2129388359","https://openalex.org/W2268443045","https://openalex.org/W2913688336","https://openalex.org/W2954327716","https://openalex.org/W3142621357","https://openalex.org/W4237721941","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3042460341","https://openalex.org/W1988772559","https://openalex.org/W2565115296","https://openalex.org/W1834737061","https://openalex.org/W2106991838","https://openalex.org/W2259552592","https://openalex.org/W3098927428","https://openalex.org/W4225648598","https://openalex.org/W1499975475","https://openalex.org/W2733475486"],"abstract_inverted_index":{"Abstract":[0],"The":[1,44],"undecidability":[2],"of":[3,16,19,22,48,56,83,138],"first-order":[4,23,72],"logic":[5],"implies":[6],"that":[7,107],"there":[8],"is":[9,36,110],"no":[10],"computable":[11],"bound":[12],"on":[13],"the":[14,53,57,89,136,139],"length":[15,84],"shortest":[17],"proofs":[18],"valid":[20,26,42],"sentences":[21,27],"logic.":[24],"Some":[25],"can":[28],"only":[29],"have":[30],"quite":[31],"long":[32],"proofs.":[33],"How":[34],"hard":[35],"it":[37],"to":[38],"prove":[39],"such":[40],"\u201chard\u201d":[41],"sentences?":[43],"polynomial":[45],"time":[46,126],"tractability":[47,55],"this":[49,100],"problem":[50,59,92,101,141],"would":[51],"imply":[52],"fixed-parameter":[54,112],"parameterized":[58],"that,":[60],"given":[61],"a":[62,71,81],"natural":[63],"number":[64],"n":[65,86],"in":[66],"unary":[67],"as":[68,75],"input":[69],"and":[70,128],"sentence":[73],"\u03c6":[74,79],"parameter,":[76],"asks":[77],"whether":[78],"has":[80,93],"proof":[82],"\u2264":[85],".":[87,132],"As":[88],"underlying":[90],"classical":[91],"been":[94],"considered":[95],"by":[96,102],"G\u00f6del":[97],"we":[98,134],"denote":[99],"p":[103,108,144],"-G\u00f6del.":[104,145],"We":[105],"show":[106],"-G\u00f6del":[109],"not":[111],"tractable":[113],"if":[114],"DTIME(":[115],"h":[116,121,131],"O(1)":[117,122],")":[118,123],"\u2260":[119],"NTIME(":[120],"for":[124],"all":[125],"constructible":[127],"increasing":[129],"functions":[130],"Moreover":[133],"analyze":[135],"complexity":[137],"construction":[140],"associated":[142],"with":[143]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}