{"id":"https://openalex.org/W2518743604","doi":"https://doi.org/10.1145/2946801","title":"On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies","display_name":"On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies","publication_year":2016,"publication_date":"2016-09-10","ids":{"openalex":"https://openalex.org/W2518743604","doi":"https://doi.org/10.1145/2946801","mag":"2518743604"},"language":"en","primary_location":{"id":"doi:10.1145/2946801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946801","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational 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/A5038321878","display_name":"Lorenzo Carlucci","orcid":"https://orcid.org/0000-0001-8238-0315"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lorenzo Carlucci","raw_affiliation_strings":["University of Rome I, Roma"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome I, Roma","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084573067","display_name":"Nicola Galesi","orcid":"https://orcid.org/0000-0002-8522-362X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicola Galesi","raw_affiliation_strings":["University of Rome I, Roma"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rome I, Roma","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya, Catalonia, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya, Catalonia, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10300232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9993000030517578,"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/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.9603843688964844},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.8774110674858093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8208111524581909},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.7531724572181702},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6323936581611633},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6186888217926025},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.6022388935089111},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5833653807640076},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5310310125350952},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5271273255348206},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46212267875671387},{"id":"https://openalex.org/keywords/combinatorial-proof","display_name":"Combinatorial proof","score":0.42437124252319336},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.1571509838104248},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07097411155700684}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9603843688964844},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.8774110674858093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8208111524581909},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.7531724572181702},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6323936581611633},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6186888217926025},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.6022388935089111},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5833653807640076},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5310310125350952},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5271273255348206},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46212267875671387},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.42437124252319336},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.1571509838104248},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07097411155700684},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2946801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946801","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/902288","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/902288","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G196495310","display_name":"Limits of Theorem Proving","funder_award_id":"20517","funder_id":"https://openalex.org/F4320306193","funder_display_name":"John Templeton Foundation"}],"funders":[{"id":"https://openalex.org/F4320306193","display_name":"John Templeton Foundation","ror":"https://ror.org/035tnyy05"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1511859173","https://openalex.org/W1597834884","https://openalex.org/W1993227745","https://openalex.org/W2015463688","https://openalex.org/W2024727602","https://openalex.org/W2026203667","https://openalex.org/W2026967932","https://openalex.org/W2043904987","https://openalex.org/W2051336598","https://openalex.org/W2065868027","https://openalex.org/W2074920973","https://openalex.org/W2078051625","https://openalex.org/W2095226356","https://openalex.org/W2100437838","https://openalex.org/W2114817374","https://openalex.org/W2115069836","https://openalex.org/W2135672707","https://openalex.org/W2137423523","https://openalex.org/W2141157177","https://openalex.org/W2161439427","https://openalex.org/W2165293955","https://openalex.org/W2170605748","https://openalex.org/W2336574378","https://openalex.org/W4211204277","https://openalex.org/W4213091458","https://openalex.org/W4249363607","https://openalex.org/W4255046774"],"related_works":["https://openalex.org/W4297817664","https://openalex.org/W2292548913","https://openalex.org/W1901246819","https://openalex.org/W2801214764","https://openalex.org/W4301517918","https://openalex.org/W2999053512","https://openalex.org/W4323065312","https://openalex.org/W2518743604","https://openalex.org/W2135672707","https://openalex.org/W4386857979"],"abstract_inverted_index":{"We":[0,59,139],"study":[1],"the":[2,71,78,87,91,108,116],"proof":[3,84,117],"complexity":[4,118],"of":[5,12,15,70,74,80,93,110,119,149],"Paris-Harrington\u2019s":[6],"Large":[7],"Ramsey":[8,123,152],"Theorem":[9],"for":[10,49,86,103,146],"bi-colorings":[11],"graphs":[13],"and":[14,30,137],"off-diagonal":[16,122,151],"Ramsey\u2019s":[17],"Theorem.":[18],"For":[19],"Paris-Harrington,":[20],"we":[21],"prove":[22,140],"a":[23,31,44,50,95,101,141,147],"non-trivial":[24,32,142],"conditional":[25,42],"lower":[26,39,88,144],"bound":[27,34,40,89,145],"in":[28,35,55,77],"Resolution":[29,143],"upper":[33],"bounded-depth":[36],"Frege.":[37],"The":[38,83],"is":[41,67,125,128],"on":[43],"(very":[45],"reasonable)":[46],"hardness":[47],"assumption":[48],"weak":[51],"(quasi-polynomial)":[52],"Pigeonhole":[53],"principle":[54,97,106,124],"R":[56],"es":[57],"(2).":[58],"show":[60],"that":[61],"under":[62],"such":[63,150],"an":[64,120],"assumption,":[65],"there":[66],"no":[68],"refutation":[69],"Paris-Harrington":[72],"formulas":[73],"size":[75],"quasi-polynomial":[76],"number":[79],"propositional":[81],"variables.":[82],"technique":[85],"extends":[90],"idea":[92],"using":[94],"combinatorial":[96,105],"to":[98,135],"blow":[99],"up":[100],"counterexample":[102],"another":[104],"beyond":[107],"threshold":[109],"inconsistency.":[111],"A":[112],"strong":[113],"link":[114],"with":[115],"unbalanced":[121],"established.":[126],"This":[127],"obtained":[129],"by":[130],"adapting":[131],"some":[132],"constructions":[133],"due":[134],"Erd\u0151s":[136],"Mills.":[138],"family":[148],"principles.":[153]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}