{"id":"https://openalex.org/W2082990188","doi":"https://doi.org/10.1215/00294527-1716784","title":"On the Indecomposability of \u03c9n","display_name":"On the Indecomposability of \u03c9n","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2082990188","doi":"https://doi.org/10.1215/00294527-1716784","mag":"2082990188"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1716784","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1716784","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-3/On-the-Indecomposability-of-%cf%89n/10.1215/00294527-1716784.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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-3/On-the-Indecomposability-of-%cf%89n/10.1215/00294527-1716784.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jared R. Corduan","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jared R. Corduan","raw_affiliation_strings":["Department of Mathematics University of Michigan Ann Arbor, Michigan 48109-1043 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Michigan Ann Arbor, Michigan 48109-1043 USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":null,"display_name":"Fran\u00e7ois G. Dorais","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois G. Dorais","raw_affiliation_strings":["Department of Mathematics University of Michigan Ann Arbor, Michigan 48109-1043 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Michigan Ann Arbor, Michigan 48109-1043 USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14497134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":"3","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.9096999764442444,"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.9096999764442444,"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.03610000014305115,"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/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.034299999475479126,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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.9842000007629395},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4984000027179718},{"id":"https://openalex.org/keywords/reverse-mathematics","display_name":"Reverse mathematics","score":0.44359999895095825},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4194999933242798},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.35350000858306885},{"id":"https://openalex.org/keywords/natural","display_name":"Natural (archaeology)","score":0.3384000062942505},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.335099995136261}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9842000007629395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7027000188827515},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48339998722076416},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.44359999895095825},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4194999933242798},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.35350000858306885},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.335099995136261},{"id":"https://openalex.org/C1769372","wikidata":"https://www.wikidata.org/wiki/Q3850844","display_name":"Combinatorial principles","level":3,"score":0.31349998712539673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30059999227523804},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.29589998722076416},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C130327152","wikidata":"https://www.wikidata.org/wiki/Q748349","display_name":"Mathematical structure","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25130000710487366}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-1716784","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1716784","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-3/On-the-Indecomposability-of-%cf%89n/10.1215/00294527-1716784.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:arXiv.org:1111.1367","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1111.1367","pdf_url":"https://arxiv.org/pdf/1111.1367","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1348524117","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1348524117","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":{"id":"doi:10.1215/00294527-1716784","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1716784","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-3/On-the-Indecomposability-of-%cf%89n/10.1215/00294527-1716784.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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2082990188.pdf","grobid_xml":"https://content.openalex.org/works/W2082990188.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1966303569","https://openalex.org/W1981894804","https://openalex.org/W1984983426","https://openalex.org/W1987660018","https://openalex.org/W2016125425","https://openalex.org/W2024864091","https://openalex.org/W2072032541","https://openalex.org/W2144268026","https://openalex.org/W2148962283","https://openalex.org/W2603470071"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,12,27,30],"reverse":[3],"mathematics":[4],"of":[5,11,29,40],"pigeonhole":[6,31],"principles":[7],"for":[8,33,43],"finite":[9],"powers":[10],"ordinal":[13],"\u03c9.":[14],"Four":[15],"natural":[16],"formulations":[17],"are":[18,24],"presented,":[19],"and":[20],"their":[21],"relative":[22],"strengths":[23],"compared.":[25],"In":[26],"analysis":[28],"principle":[32],"\u03c92,":[34],"we":[35],"uncover":[36],"two":[37],"weak":[38],"variants":[39],"Ramsey\u2019s":[41],"theorem":[42],"pairs.":[44]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2016-06-24T00:00:00"}