{"id":"https://openalex.org/W2011143411","doi":"https://doi.org/10.1215/00294527-2688051","title":"Bounded Martin\u2019s Maximum with an Asterisk","display_name":"Bounded Martin\u2019s Maximum with an Asterisk","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2011143411","doi":"https://doi.org/10.1215/00294527-2688051","mag":"2011143411"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2688051","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2688051","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017293866","display_name":"David Asper\u00f3","orcid":"https://orcid.org/0000-0002-7972-2860"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Asper\u00f3","raw_affiliation_strings":["School of Mathematics"],"affiliations":[{"raw_affiliation_string":"School of Mathematics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013788651","display_name":"Ralf Schindler","orcid":"https://orcid.org/0000-0003-0174-8048"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ralf Schindler","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017293866"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.07853301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"55","issue":"3","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.9977999925613403,"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.9977999925613403,"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/bounded-function","display_name":"Bounded function","score":0.7568591237068176},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6821044683456421},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6382715702056885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5751739740371704},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5123008489608765},{"id":"https://openalex.org/keywords/reverse-mathematics","display_name":"Reverse mathematics","score":0.5055594444274902},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45524758100509644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4397912919521332},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.42448002099990845},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.35642436146736145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19002771377563477},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11111217737197876}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7568591237068176},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6821044683456421},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6382715702056885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5751739740371704},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5123008489608765},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.5055594444274902},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45524758100509644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4397912919521332},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.42448002099990845},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.35642436146736145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19002771377563477},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11111217737197876},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1215/00294527-2688051","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2688051","pdf_url":null,"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/1406034050","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1406034050","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.348.3211","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3211","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwmath.uni-muenster.de/logik/Personen/rds/bounded_martins_maximum_star_newest_version.pdf","raw_type":"text"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:60831","is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/60831/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W83311697","https://openalex.org/W98969548","https://openalex.org/W187570007","https://openalex.org/W2031165885","https://openalex.org/W2046445464","https://openalex.org/W2081677573","https://openalex.org/W2090209200","https://openalex.org/W2105223399","https://openalex.org/W2111190351","https://openalex.org/W2117873821","https://openalex.org/W2154198535","https://openalex.org/W2168662095","https://openalex.org/W2319297044"],"related_works":["https://openalex.org/W3112295066","https://openalex.org/W4229690001","https://openalex.org/W3109582549","https://openalex.org/W1574825745","https://openalex.org/W2367592385","https://openalex.org/W2151251236","https://openalex.org/W4237197901","https://openalex.org/W4210343663","https://openalex.org/W3034016151","https://openalex.org/W2951707517"],"abstract_inverted_index":{"We":[0,28,50],"isolate":[1],"natural":[2],"strengthenings":[3],"of":[4,21,39],"Bounded":[5],"Martin\u2019s":[6],"Maximum":[7],"which":[8,59],"we":[9,24],"call":[10],"BMM\u2217":[11],"and":[12,23],"A\u2212BMM\u2217,++":[13,33,55],"(where":[14],"A":[15,41,58],"is":[16,60],"a":[17],"universally":[18,61],"Baire":[19],"set":[20,38],"reals),":[22],"investigate":[25],"their":[26],"consequences.":[27],"also":[29],"show":[30],"that":[31,52],"if":[32],"holds":[34,48],"true":[35],"for":[36,56],"every":[37,57],"reals":[40],"in":[42],"L(R),":[43],"then":[44],"Woodin\u2019s":[45],"axiom":[46],"(\u2217)":[47],"true.":[49],"conjecture":[51],"MM++":[53],"implies":[54],"Baire.":[62]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}