{"id":"https://openalex.org/W2130233653","doi":"https://doi.org/10.1215/00294527-2009-019","title":"Ramsey's Theorem for Pairs and Provably Recursive Functions","display_name":"Ramsey's Theorem for Pairs and Provably Recursive Functions","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2130233653","doi":"https://doi.org/10.1215/00294527-2009-019","mag":"2130233653"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2009-019","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-019","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-4/Ramseys-Theorem-for-Pairs-and-Provably-Recursive-Functions/10.1215/00294527-2009-019.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-4/Ramseys-Theorem-for-Pairs-and-Provably-Recursive-Functions/10.1215/00294527-2009-019.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003647373","display_name":"Ulrich Kohlenbach","orcid":"https://orcid.org/0000-0002-4925-3506"},"institutions":[{"id":"https://openalex.org/I107257983","display_name":"Darmstadt University of Applied Sciences","ror":"https://ror.org/047wbd030","country_code":"DE","type":"education","lineage":["https://openalex.org/I107257983"]},{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulrich Kohlenbach","raw_affiliation_strings":["Fachbereich Mathematik Technische Universitt Darmstadt Schlossgartenstrae 7, 64289 Darmstadt GERMANY","Fachbereich Mathematik Technische Universit\u00e4t Darmstadt Schlossgartenstra\u00dfe 7, 64289 Darmstadt GERMANY"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik Technische Universitt Darmstadt Schlossgartenstrae 7, 64289 Darmstadt GERMANY","institution_ids":["https://openalex.org/I107257983","https://openalex.org/I31512782"]},{"raw_affiliation_string":"Fachbereich Mathematik Technische Universit\u00e4t Darmstadt Schlossgartenstra\u00dfe 7, 64289 Darmstadt GERMANY","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080684787","display_name":"Alexander Kreuzer","orcid":"https://orcid.org/0000-0002-2352-3547"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]},{"id":"https://openalex.org/I107257983","display_name":"Darmstadt University of Applied Sciences","ror":"https://ror.org/047wbd030","country_code":"DE","type":"education","lineage":["https://openalex.org/I107257983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexander Kreuzer","raw_affiliation_strings":["Fachbereich Mathematik Technische Universitt Darmstadt Schlossgartenstrae 7, 64289 Darmstadt GERMANY","Fachbereich Mathematik Technische Universit\u00e4t Darmstadt Schlossgartenstra\u00dfe 7, 64289 Darmstadt GERMANY"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik Technische Universitt Darmstadt Schlossgartenstrae 7, 64289 Darmstadt GERMANY","institution_ids":["https://openalex.org/I107257983","https://openalex.org/I31512782"]},{"raw_affiliation_string":"Fachbereich Mathematik Technische Universit\u00e4t Darmstadt Schlossgartenstra\u00dfe 7, 64289 Darmstadt GERMANY","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080684787"],"corresponding_institution_ids":["https://openalex.org/I107257983","https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":1.0602,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78565667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"50","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9891999959945679,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8395445346832275},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.8249533176422119},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7912333011627197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6598263382911682},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.551875650882721},{"id":"https://openalex.org/keywords/\u03bc-operator","display_name":"\u03bc operator","score":0.5035702586174011},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.48284250497817993},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4554173946380615},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4501297175884247},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4492557644844055},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.4455554485321045},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.380983829498291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3590351343154907}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8395445346832275},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.8249533176422119},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7912333011627197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6598263382911682},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.551875650882721},{"id":"https://openalex.org/C85955891","wikidata":"https://www.wikidata.org/wiki/Q307772","display_name":"\u03bc operator","level":3,"score":0.5035702586174011},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.48284250497817993},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4554173946380615},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4501297175884247},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4492557644844055},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.4455554485321045},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.380983829498291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3590351343154907},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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":3,"locations":[{"id":"doi:10.1215/00294527-2009-019","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-019","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-4/Ramseys-Theorem-for-Pairs-and-Provably-Recursive-Functions/10.1215/00294527-2009-019.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1265899123","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1265899123","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.365.2112","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.2112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mathematik.tu-darmstadt.de/~kohlenbach/KreuzerKohlenbach.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1215/00294527-2009-019","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-019","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-4/Ramseys-Theorem-for-Pairs-and-Provably-Recursive-Functions/10.1215/00294527-2009-019.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2130233653.pdf","grobid_xml":"https://content.openalex.org/works/W2130233653.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W116431497","https://openalex.org/W561202933","https://openalex.org/W998536193","https://openalex.org/W1483568252","https://openalex.org/W1487079802","https://openalex.org/W1525064220","https://openalex.org/W1556453281","https://openalex.org/W1757113349","https://openalex.org/W1973185693","https://openalex.org/W1973446732","https://openalex.org/W1978068660","https://openalex.org/W2001283416","https://openalex.org/W2016125425","https://openalex.org/W2093222212","https://openalex.org/W2095689360","https://openalex.org/W2131443763","https://openalex.org/W2144268026","https://openalex.org/W2148962283","https://openalex.org/W2659295935","https://openalex.org/W4231695287"],"related_works":["https://openalex.org/W6819771","https://openalex.org/W955824272","https://openalex.org/W4244106347","https://openalex.org/W2549889701","https://openalex.org/W1596057910","https://openalex.org/W2045115070","https://openalex.org/W4287829245","https://openalex.org/W3010154460","https://openalex.org/W1635266006","https://openalex.org/W2326563584"],"abstract_inverted_index":{"This":[0,230],"paper":[1],"addresses":[2],"the":[3,22,39,77,92,97,129,154,170,174,199,204,216,233,236,246],"strength":[4],"of":[5,24,69,79,86,99,108,116,139,156,173,182,201,207,250],"Ramsey's":[6,34,183],"theorem":[7,35,184,237],"for":[8,36,136,153],"pairs":[9,37],"(":[10],"R":[11,28,212,251],"T":[12,29,213,252],"2":[13,14,30,31,214,215,253,254],")":[15],"over":[16,143],"a":[17,56,66,123,151,180],"weak":[18,57,62],"base":[19,58],"theory":[20,59,94],"from":[21,106,160,198],"perspective":[23,200],"'proof":[25],"mining'.":[26],"Let":[27],"\u2212":[32],"denote":[33],"where":[38],"coloring":[40],"is":[41,122,169,177,232],"given":[42],"by":[43],"an":[44],"explicit":[45],"term":[46],"involving":[47],"only":[48],"numeric":[49],"variables.":[50],"We":[51],"add":[52],"this":[53,117],"principle":[54],"to":[55,75,128,186,238],"that":[60,132,179,255],"includes":[61],"K\u00f6nig's":[63],"Lemma":[64],"and":[65,103,141,188,245],"substantial":[67],"amount":[68],"\u03a3":[70],"1":[71],"0":[72],"-induction":[73],"(enough":[74],"prove":[76],"totality":[78],"all":[80,87],"primitive":[81,88,100,144,157,227,257],"recursive":[82,89,101,145,158,228,258],"functions":[83],"but":[84],"not":[85,224],"functionals).":[90],"In":[91],"resulting":[93],"we":[95],"show":[96],"extractability":[98],"programs":[102],"uniform":[104],"bounds":[105,159],"proofs":[107,161,209],"\u2200":[109],"\u2203":[110],"-theorems.":[111],"There":[112],"are":[113,256],"two":[114],"components":[115],"work.":[118],"The":[119,166],"first":[120],"component":[121,168],"general":[124],"proof-theoretic":[125],"result,":[126],"due":[127,185],"second":[130,167],"author,":[131],"establishes":[133],"conservation":[134],"results":[135],"restricted":[137,195],"principles":[138],"choice":[140],"comprehension":[142],"arithmetic":[146],"PRA":[147],"as":[148,150],"well":[149],"method":[152],"extraction":[155],"based":[162,210],"on":[163,211],"such":[164],"principles.":[165,196],"main":[171],"novelty":[172],"paper:":[175],"it":[176],"shown":[178],"proof":[181,202,247],"Erd\u0151s":[187],"Rado":[189],"can":[190],"be":[191,239],"formalized":[192],"using":[193],"these":[194],"So":[197],"unwinding":[203],"computational":[205,217],"content":[206],"concrete":[208],"complexity":[218],"will,":[219],"in":[220,259],"most":[221],"practical":[222],"cases,":[223],"go":[225],"beyond":[226],"complexity.":[229],"even":[231],"case":[234],"when":[235],"proved":[240],"has":[241],"function":[242],"parameters":[243],"f":[244],"uses":[248],"instances":[249],"f.":[260]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}