{"id":"https://openalex.org/W2070481091","doi":"https://doi.org/10.1215/00294527-1306154","title":"Reasonable Ultrafilters, Again","display_name":"Reasonable Ultrafilters, Again","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2070481091","doi":"https://doi.org/10.1215/00294527-1306154","mag":"2070481091"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1306154","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1306154","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-52/issue-2/Reasonable-Ultrafilters-Again/10.1215/00294527-1306154.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-52/issue-2/Reasonable-Ultrafilters-Again/10.1215/00294527-1306154.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023432469","display_name":"Andrzej Ros\u0142anowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrzej Ros\u0142anowski","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024923217","display_name":"Saharon Shelah","orcid":"https://orcid.org/0000-0003-0462-3152"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saharon Shelah","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023432469"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1092,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.76569533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"52","issue":"2","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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9968000054359436,"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/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.9929999709129333,"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/uncountable-set","display_name":"Uncountable set","score":0.8834514617919922},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.7403595447540283},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6776798367500305},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6534804701805115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6094551682472229},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5313827395439148},{"id":"https://openalex.org/keywords/regular-cardinal","display_name":"Regular cardinal","score":0.45466604828834534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2918983995914459},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25397539138793945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07585978507995605}],"concepts":[{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.8834514617919922},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.7403595447540283},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6776798367500305},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6534804701805115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6094551682472229},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5313827395439148},{"id":"https://openalex.org/C89507440","wikidata":"https://www.wikidata.org/wiki/Q1193137","display_name":"Regular cardinal","level":2,"score":0.45466604828834534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2918983995914459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25397539138793945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07585978507995605},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-1306154","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1306154","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-52/issue-2/Reasonable-Ultrafilters-Again/10.1215/00294527-1306154.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":"mag:2953114225","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/math/0605067v2","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1303995710","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1303995710","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-1306154","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1306154","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-52/issue-2/Reasonable-Ultrafilters-Again/10.1215/00294527-1306154.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/W2070481091.pdf","grobid_xml":"https://content.openalex.org/works/W2070481091.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1595388840","https://openalex.org/W1632453034","https://openalex.org/W2006389001","https://openalex.org/W2032413729","https://openalex.org/W2033413692","https://openalex.org/W2036386973","https://openalex.org/W2040619064","https://openalex.org/W2045961049","https://openalex.org/W2090375774","https://openalex.org/W2104824955","https://openalex.org/W4243701117"],"related_works":["https://openalex.org/W4289676933","https://openalex.org/W2950296149","https://openalex.org/W2885719937","https://openalex.org/W4297981628","https://openalex.org/W2952331208","https://openalex.org/W4298219619","https://openalex.org/W2097355897","https://openalex.org/W2167408243","https://openalex.org/W2567038806","https://openalex.org/W2557290701"],"abstract_inverted_index":{"We":[0,15,38,64],"continue":[1],"investigations":[2],"of":[3,19,33,57],"reasonable":[4,47,82],"ultrafilters":[5,20,48,68],"on":[6,49],"uncountable":[7],"cardinals":[8],"defined":[9],"in":[10,30],"previous":[11],"work":[12],"by":[13,70,76],"Shelah.":[14],"introduce":[16],"stronger":[17],"properties":[18,26],"and":[21],"we":[22],"show":[23,42,66],"that":[24,43],"those":[25],"may":[27],"be":[28,74,85],"handled":[29],"\u03bb-support":[31],"iterations":[32],"reasonably":[34],"bounding":[35],"forcing":[36,77],"notions.":[37],"use":[39],"this":[40],"to":[41,84],"consistently":[44],"there":[45],"are":[46],"an":[50],"inaccessible":[51],"cardinal":[52],"\u03bb":[53,62],"with":[54,87],"generating":[55],"systems":[56,72],"size":[58],"less":[59],"than":[60],"2":[61],".":[63],"also":[65],"how":[67],"generated":[69],"small":[71],"can":[73],"killed":[75],"notions":[78],"which":[79],"have":[80],"enough":[81],"completeness":[83],"iterated":[86],"\u03bb-supports.":[88]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}