{"id":"https://openalex.org/W1968571926","doi":"https://doi.org/10.1305/ndjfl/1093956243","title":"A theorem on $n$-tuples which is equivalent to the well-ordering theorem.","display_name":"A theorem on $n$-tuples which is equivalent to the well-ordering theorem.","publication_year":1967,"publication_date":"1967-04-01","ids":{"openalex":"https://openalex.org/W1968571926","doi":"https://doi.org/10.1305/ndjfl/1093956243","mag":"1968571926"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093956243","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956243","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-1-2/A-theorem-on-n-tuples-which-is-equivalent-to-the/10.1305/ndjfl/1093956243.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-8/issue-1-2/A-theorem-on-n-tuples-which-is-equivalent-to-the/10.1305/ndjfl/1093956243.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087390390","display_name":"Herman Rubin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Rubin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073538536","display_name":"Jean E. Rubin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. E. Rubin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10866477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"1-2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.8776999711990356,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.8776999711990356,"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.7942000031471252,"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/axiom-of-choice","display_name":"Axiom of choice","score":0.8413138389587402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7195560932159424},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6426966190338135},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5885753035545349},{"id":"https://openalex.org/keywords/sierpinski-triangle","display_name":"Sierpinski triangle","score":0.5675970315933228},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46378979086875916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4200235605239868},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.13356706500053406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11407425999641418},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061723142862319946},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.05780133605003357}],"concepts":[{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.8413138389587402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7195560932159424},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6426966190338135},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5885753035545349},{"id":"https://openalex.org/C27176706","wikidata":"https://www.wikidata.org/wiki/Q663365","display_name":"Sierpinski triangle","level":3,"score":0.5675970315933228},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46378979086875916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4200235605239868},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.13356706500053406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11407425999641418},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061723142862319946},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.05780133605003357},{"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/C40636538","wikidata":"https://www.wikidata.org/wiki/Q81392","display_name":"Fractal","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":2,"locations":[{"id":"doi:10.1305/ndjfl/1093956243","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956243","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-1-2/A-theorem-on-n-tuples-which-is-equivalent-to-the/10.1305/ndjfl/1093956243.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/1093956243","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093956243","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.1305/ndjfl/1093956243","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956243","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-1-2/A-theorem-on-n-tuples-which-is-equivalent-to-the/10.1305/ndjfl/1093956243.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/W1968571926.pdf","grobid_xml":"https://content.openalex.org/works/W1968571926.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W127126552","https://openalex.org/W328650061","https://openalex.org/W2028210947","https://openalex.org/W6611371219"],"related_works":["https://openalex.org/W1991823548","https://openalex.org/W2057184769","https://openalex.org/W2976868548","https://openalex.org/W2019604532","https://openalex.org/W3112295066","https://openalex.org/W4210343663","https://openalex.org/W2373903136","https://openalex.org/W3196396437","https://openalex.org/W2122650439","https://openalex.org/W2185713319"],"abstract_inverted_index":{"W.":[0,28],"Sierpinski":[1],"[5]":[2],"proved":[3,15,40,60],"that":[4,16,41],"the":[5,20,52,61],"axiom":[6,21,53],"of":[7,22,54,64],"choice":[8,55],"implies":[9,19],"P(3,":[10,17],"\u00a3)and":[11],"B.":[12],"Sobocinski":[13],"[6]":[14],"2)":[18],"choice.":[23],"Moreover,":[24],"unknown":[25],"to":[26,51],"us,":[27],"Frascella":[29,39],"has":[30],"also":[31],"been":[32],"working":[33],"on":[34],"this":[35,65],"problem.":[36],"In":[37],"[1]":[38],"for":[42],"each":[43],"natural":[44],"number":[45],"n>2,":[46],"P(n,":[47],"n-1)":[48],"is":[49],"equivalent":[50],"and":[56],"in":[57],"[2]":[58],"he":[59],"main":[62],"results":[63],"paper.":[66],"However,":[67],"Frascella's":[68],"proofs":[69],"are":[70],"considerably":[71],"different":[72],"from":[73],"ours.":[74]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}