{"id":"https://openalex.org/W2114195278","doi":"https://doi.org/10.2307/2272066","title":"Infinite exponent partition relations and well-ordered choice","display_name":"Infinite exponent partition relations and well-ordered choice","publication_year":1973,"publication_date":"1973-06-01","ids":{"openalex":"https://openalex.org/W2114195278","doi":"https://doi.org/10.2307/2272066","mag":"2114195278"},"language":"en","primary_location":{"id":"doi:10.2307/2272066","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272066","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/A5034562840","display_name":"E. M. Kleinberg","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. M. Kleinberg","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","Massachusetts Institute of Technology Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009639694","display_name":"Joel Seiferas","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. I. Seiferas","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","Massachusetts Institute of Technology Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034562840"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.2636328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"2","first_page":"299","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991999864578247,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7399163842201233},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.7345803380012512},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.6464166045188904},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5877196788787842},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5091080069541931},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.4566045105457306},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4268907904624939},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38617825508117676},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3624893128871918},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.2622210681438446},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.25202178955078125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14054885506629944}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7399163842201233},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.7345803380012512},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6464166045188904},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5877196788787842},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5091080069541931},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.4566045105457306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4268907904624939},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38617825508117676},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3624893128871918},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2622210681438446},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25202178955078125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14054885506629944},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2272066","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272066","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"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183738635","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183738635","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":[{"score":0.5,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W655855359","https://openalex.org/W1996516812","https://openalex.org/W2155993241","https://openalex.org/W4291439952"],"related_works":["https://openalex.org/W4214831444","https://openalex.org/W2027586194","https://openalex.org/W2055381384","https://openalex.org/W3112295066","https://openalex.org/W2339451782","https://openalex.org/W2015215276","https://openalex.org/W4296151379","https://openalex.org/W4287123853","https://openalex.org/W2099566154","https://openalex.org/W4210343663"],"abstract_inverted_index":{"The":[0,215],"study":[1,86],"of":[2,47,61,87,103,127,132,135,170,180,198,257],"partition":[3,52,90,163,241],"relations":[4,68,91,105,164,200],"for":[5,18],"cardinal":[6],"numbers":[7],"introduced":[8],"by":[9,38,224],"Erd\u00f6s":[10],"and":[11,95,111,119,220],"his":[12],"school":[13],"in":[14,27,32,56,109,116,228,263],"the":[15,19,42,59,124,133,177,195,237],"1950's":[16],"has,":[17],"past":[20],"several":[21],"years,":[22],"had":[23],"a":[24,65,76,84,156,166],"profound":[25],"impact":[26],"logic.":[28],"Unfortunately,":[29],"quite":[30],"early":[31],"their":[33],"development,":[34],"it":[35],"was":[36],"noticed":[37,82],"Rado":[39,175],"[1]":[40],"that":[41,131,236],"potentially":[43],"most":[44],"fruitful":[45,138],"class":[46],"such":[48,67,104,199],"relations,":[49,53,129],"infinite":[50,88,161,239],"exponent":[51,89,162,240],"were":[54,69],"always":[55],"contradiction":[57],"with":[58,155,252,267],"axiom":[60,134,179],"choice":[62,181,213,219,222,254,256],"(AC).":[63],"As":[64],"result,":[66],"overlooked.":[70],"This":[71],"turned":[72],"out":[73],"to":[74,150,182,186],"be":[75],"mistake;":[77],"for,":[78],"as":[79,139,141],"has":[80,233],"been":[81],"recently,":[83],"close":[85],"is":[92,137,223,250,265],"both":[93],"interesting":[94],"rewarding.":[96],"For":[97,143,231],"example,":[98],"there":[99],"are":[100,107],"weakened":[101],"versions":[102],"which":[106,112],"provable":[108],"ZF":[110],"have":[113],"valuable":[114],"applications":[115],"recursion":[117],"theory":[118,126,197],"set":[120],"theory.":[121],"In":[122],"addition,":[123],"pure":[125],"these":[128],"like":[130],"determinateness,":[136],"well":[140],"elegant.":[142],"more":[144,157,167,191],"background":[145],"here":[146],"one":[147,203],"should":[148],"refer":[149],"[3].":[151,214],"At":[152],"any":[153,188],"rate,":[154],"detailed":[158],"look":[159,193],"at":[160,194],"came":[165],"refined":[168],"version":[169],"Rado's":[171],"original":[172],"theorem.":[173],"Specifically,":[174],"used":[176],"full":[178,221],"carefully":[183],"construct":[184],"partitions":[185,209],"violate":[187],"desired":[189,208],"relation\u2014a":[190],"sophisticated":[192],"actual":[196],"indicated":[201],"how":[202],"could":[204],"put":[205],"together":[206],"some":[207],"using":[210],"only":[211],"well-ordered":[212,218],"distinction":[216],"between":[217],"no":[225],"means":[226],"vacuous":[227],"this":[229],"context.":[230],"Mathias":[232],"shown":[234],"[4]":[235],"simplest":[238],"relation,":[242],"\u03c9":[243,246,248],"\u2192":[244],"(":[245],")":[247,261],",":[249],"consistent":[251,266],"countable":[253],"(well-ordered":[255],"length":[258],"\u2135":[259],"0":[260],"and,":[262],"fact,":[264],"dependent":[268],"choice.":[269]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}