{"id":"https://openalex.org/W2001409760","doi":"https://doi.org/10.1215/00294527-2010-027","title":"A Covering Lemma for HOD of K(\u211d)","display_name":"A Covering Lemma for HOD of K(\u211d)","publication_year":2010,"publication_date":"2010-09-29","ids":{"openalex":"https://openalex.org/W2001409760","doi":"https://doi.org/10.1215/00294527-2010-027","mag":"2001409760"},"language":"de","primary_location":{"id":"doi:10.1215/00294527-2010-027","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2010-027","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-51/issue-4/A-Covering-Lemma-for-HOD-of-K%e2%84%9d/10.1215/00294527-2010-027.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-51/issue-4/A-Covering-Lemma-for-HOD-of-K%e2%84%9d/10.1215/00294527-2010-027.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074703027","display_name":"Daniel W. Cunningham","orcid":"https://orcid.org/0000-0002-5900-5223"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel W. Cunningham","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074703027"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0844628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"4","first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.9822999835014343,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9761999845504761,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8227071762084961},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7402759790420532},{"id":"https://openalex.org/keywords/surjective-function","display_name":"Surjective function","score":0.7335336208343506},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.654220461845398},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5646060705184937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5471741557121277},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5305835604667664},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.5274249315261841},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.4710155725479126},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.22929516434669495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14880189299583435},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05416029691696167}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8227071762084961},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7402759790420532},{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.7335336208343506},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.654220461845398},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5646060705184937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5471741557121277},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5305835604667664},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.5274249315261841},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.4710155725479126},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.22929516434669495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14880189299583435},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05416029691696167},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-2010-027","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2010-027","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-51/issue-4/A-Covering-Lemma-for-HOD-of-K%e2%84%9d/10.1215/00294527-2010-027.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/1285765797","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1285765797","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-2010-027","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2010-027","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-51/issue-4/A-Covering-Lemma-for-HOD-of-K%e2%84%9d/10.1215/00294527-2010-027.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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2001409760.pdf","grobid_xml":"https://content.openalex.org/works/W2001409760.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1555991696","https://openalex.org/W1976681256","https://openalex.org/W1982071319","https://openalex.org/W2020209358","https://openalex.org/W2078734871","https://openalex.org/W2290645075","https://openalex.org/W2478289388","https://openalex.org/W4237141590","https://openalex.org/W4247267290","https://openalex.org/W4293117209"],"related_works":["https://openalex.org/W3109582549","https://openalex.org/W1608708592","https://openalex.org/W2606121466","https://openalex.org/W4377158283","https://openalex.org/W2135503406","https://openalex.org/W2901423989","https://openalex.org/W2087878692","https://openalex.org/W4283312226","https://openalex.org/W2352090307","https://openalex.org/W177504871"],"abstract_inverted_index":{"Working":[0],"in":[1,24],"ZF+AD":[2],"alone,":[3],"we":[4],"prove":[5],"that":[6],"every":[7],"set":[8,21,47],"of":[9,22,26,28,48,55,63],"ordinals":[10,23,57],"with":[11,38],"cardinality":[12],"at":[13],"least":[14],"\u0398":[15,51],"can":[16],"be":[17],"covered":[18],"by":[19],"a":[20],"HOD":[25],"K(\u211d)":[27],"the":[29,46,53,56,60],"same":[30],"cardinality,":[31],"when":[32],"there":[33],"is":[34,45,52],"no":[35],"inner":[36],"model":[37],"an":[39],"\u211d-complete":[40],"measurable":[41],"cardinal.":[42],"Here":[43],"\u211d":[44],"reals":[49],"and":[50],"supremum":[54],"which":[58],"are":[59],"surjective":[61],"image":[62],"\u211d.":[64]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}