{"id":"https://openalex.org/W2193031255","doi":"https://doi.org/10.1215/00294527-2018-0016","title":"On the Uniform Computational Content of the Baire Category Theorem","display_name":"On the Uniform Computational Content of the Baire Category Theorem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2193031255","doi":"https://doi.org/10.1215/00294527-2018-0016","mag":"2193031255"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2018-0016","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2018-0016","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-4/On-the-Uniform-Computational-Content-of-the-Baire-Category-Theorem/10.1215/00294527-2018-0016.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-59/issue-4/On-the-Uniform-Computational-Content-of-the-Baire-Category-Theorem/10.1215/00294527-2018-0016.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Vasco Brattka","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vasco Brattka","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Matthew Hendtlass","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew Hendtlass","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Alexander P. Kreuzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander P. Kreuzer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6769,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76296659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.35409998893737793,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.35409998893737793,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.2775999903678894,"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.09880000352859497,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/baire-category-theorem","display_name":"Baire category theorem","score":0.9524000287055969},{"id":"https://openalex.org/keywords/baire-measure","display_name":"Baire measure","score":0.7842000126838684},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.7139000296592712},{"id":"https://openalex.org/keywords/baire-space","display_name":"Baire space","score":0.6902999877929688},{"id":"https://openalex.org/keywords/nowhere-dense-set","display_name":"Nowhere dense set","score":0.6644999980926514},{"id":"https://openalex.org/keywords/closed-set","display_name":"Closed set","score":0.6019999980926514},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.545199990272522},{"id":"https://openalex.org/keywords/complete-metric-space","display_name":"Complete metric space","score":0.5436999797821045},{"id":"https://openalex.org/keywords/open-mapping-theorem","display_name":"Open mapping theorem (functional analysis)","score":0.5027999877929688},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.4812999963760376}],"concepts":[{"id":"https://openalex.org/C44659138","wikidata":"https://www.wikidata.org/wiki/Q1052678","display_name":"Baire category theorem","level":2,"score":0.9524000287055969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.866599977016449},{"id":"https://openalex.org/C189892329","wikidata":"https://www.wikidata.org/wiki/Q2577940","display_name":"Baire measure","level":2,"score":0.7842000126838684},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.7139000296592712},{"id":"https://openalex.org/C166359235","wikidata":"https://www.wikidata.org/wiki/Q1150180","display_name":"Baire space","level":2,"score":0.6902999877929688},{"id":"https://openalex.org/C17327563","wikidata":"https://www.wikidata.org/wiki/Q1991405","display_name":"Nowhere dense set","level":3,"score":0.6644999980926514},{"id":"https://openalex.org/C164953516","wikidata":"https://www.wikidata.org/wiki/Q320357","display_name":"Closed set","level":2,"score":0.6019999980926514},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.545199990272522},{"id":"https://openalex.org/C93361540","wikidata":"https://www.wikidata.org/wiki/Q848569","display_name":"Complete metric space","level":3,"score":0.5436999797821045},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5113000273704529},{"id":"https://openalex.org/C42030387","wikidata":"https://www.wikidata.org/wiki/Q944297","display_name":"Open mapping theorem (functional analysis)","level":5,"score":0.5027999877929688},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.43810001015663147},{"id":"https://openalex.org/C31316033","wikidata":"https://www.wikidata.org/wiki/Q1207972","display_name":"Polish space","level":3,"score":0.4318999946117401},{"id":"https://openalex.org/C171636804","wikidata":"https://www.wikidata.org/wiki/Q1149458","display_name":"Compactness theorem","level":4,"score":0.42829999327659607},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.39640000462532043},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.38370001316070557},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C20211961","wikidata":"https://www.wikidata.org/wiki/Q1068085","display_name":"Closed graph theorem","level":5,"score":0.3564000129699707},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C180937797","wikidata":"https://www.wikidata.org/wiki/Q200787","display_name":"G\u00f6del's incompleteness theorems","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C194886279","wikidata":"https://www.wikidata.org/wiki/Q430271","display_name":"Fundamental theorem","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C146147875","wikidata":"https://www.wikidata.org/wiki/Q1144897","display_name":"Brouwer fixed-point theorem","level":3,"score":0.29670000076293945},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.2935999929904938},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.29350000619888306},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C180375552","wikidata":"https://www.wikidata.org/wiki/Q2635326","display_name":"Structured program theorem","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C197451259","wikidata":"https://www.wikidata.org/wiki/Q1477053","display_name":"Arzel\u00e0\u2013Ascoli theorem","level":5,"score":0.27090001106262207},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C3853638","wikidata":"https://www.wikidata.org/wiki/Q1314081","display_name":"Gap theorem","level":5,"score":0.2644999921321869},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C84496893","wikidata":"https://www.wikidata.org/wiki/Q1135782","display_name":"Urysohn and completely Hausdorff spaces","level":4,"score":0.2542000114917755},{"id":"https://openalex.org/C90985795","wikidata":"https://www.wikidata.org/wiki/Q5042898","display_name":"Carlson's theorem","level":5,"score":0.2540000081062317}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-2018-0016","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2018-0016","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-4/On-the-Uniform-Computational-Content-of-the-Baire-Category-Theorem/10.1215/00294527-2018-0016.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:1510.01913","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.01913","pdf_url":"https://arxiv.org/pdf/1510.01913","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/1539396028","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1539396028","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-2018-0016","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2018-0016","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-59/issue-4/On-the-Uniform-Computational-Content-of-the-Baire-Category-Theorem/10.1215/00294527-2018-0016.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":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320324164","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79"},{"id":"https://openalex.org/F4320334679","display_name":"Research Executive Agency","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2193031255.pdf","grobid_xml":"https://content.openalex.org/works/W2193031255.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W10794601","https://openalex.org/W25617978","https://openalex.org/W32678173","https://openalex.org/W194981847","https://openalex.org/W1517996398","https://openalex.org/W1544955410","https://openalex.org/W1559786600","https://openalex.org/W1574049752","https://openalex.org/W1700724592","https://openalex.org/W1813874586","https://openalex.org/W1987187730","https://openalex.org/W1991124928","https://openalex.org/W2018837422","https://openalex.org/W2023021577","https://openalex.org/W2023962937","https://openalex.org/W2027931514","https://openalex.org/W2044009111","https://openalex.org/W2055394931","https://openalex.org/W2058444173","https://openalex.org/W2059834295","https://openalex.org/W2069846627","https://openalex.org/W2120390967","https://openalex.org/W2141528037","https://openalex.org/W2154952077","https://openalex.org/W2277227085","https://openalex.org/W2322118446","https://openalex.org/W2345216810","https://openalex.org/W2483853972","https://openalex.org/W2806893125","https://openalex.org/W2885774045","https://openalex.org/W2896051258","https://openalex.org/W2912268883","https://openalex.org/W2950007347","https://openalex.org/W2963693343","https://openalex.org/W4243563333","https://openalex.org/W4245716479"],"related_works":[],"abstract_inverted_index":{"We":[0,210],"study":[1],"the":[2,10,15,85,93,97,110,126,144,148,177,191,217,227,231,239,246],"uniform":[3],"computational":[4,74,174],"content":[5],"of":[6,9,57,84,96,115,128,139,193,216,252],"different":[7,73,81,173,187],"versions":[8,83,153,215],"Baire":[11,19,50,218,247],"category":[12,20,51,219,248],"theorem":[13,21,52,59,69,249],"in":[14,109,159,166,176,189,229],"Weihrauch":[16,178],"lattice.":[17,179],"The":[18,49,100,120],"can":[22,61,70,89,200,234],"be":[23,39,62,90,236],"seen":[24,91],"as":[25,92],"a":[26,32,58,113,129,137],"pigeonhole":[27],"principle":[28],"that":[29,31,60,66,132,142,226],"states":[30],"complete":[33],"(i.e.,":[34,46],"\u201clarge\u201d)":[35],"metric":[36],"space":[37],"cannot":[38],"decomposed":[40],"into":[41],"countably":[42],"many":[43],"nowhere":[44,116],"dense":[45,117],"small)":[47],"pieces.":[48],"is":[53,133,196],"an":[54,106],"illuminating":[55],"example":[56],"used":[63],"to":[64,104,124,156,250],"demonstrate":[65],"one":[67,88],"classical":[68,160],"have":[71],"several":[72],"interpretations.":[75],"For":[76],"one,":[77],"we":[78,184,199,243],"distinguish":[79,201],"two":[80,149],"logical":[82,182],"theorem,":[86],"where":[87],"contrapositive":[94],"form":[95],"other":[98,158],"one.":[99],"first":[101],"version":[102,122],"aims":[103,123],"find":[105,125],"uncovered":[107],"point":[108],"space,":[111],"given":[112,136],"sequence":[114,138,192],"closed":[118,130,140,194,208],"sets.":[119,209,257],"second":[121],"index":[127],"set":[131],"somewhere":[134],"dense,":[135],"sets":[141,195],"cover":[143],"space.":[145],"Even":[146],"though":[147],"statements":[150],"behind":[151],"these":[152],"are":[154,163],"equivalent":[155,165],"each":[157],"logic,":[161,168],"they":[162,171],"not":[164],"intuitionistic":[167],"and":[169,204,254],"likewise,":[170],"exhibit":[172],"behavior":[175],"Besides":[180],"this":[181],"distinction,":[183],"also":[185,235,244],"consider":[186],"ways":[188],"which":[190],"\u201cgiven.\u201d":[197],"Essentially,":[198],"between":[202],"positive":[203],"negative":[205],"information":[206,233],"on":[207],"discuss":[211],"all":[212],"four":[213],"resulting":[214],"theorem.":[220],"Somewhat":[221],"surprisingly,":[222],"it":[223],"turns":[224],"out":[225],"difference":[228],"providing":[230],"input":[232],"expressed":[237],"with":[238],"jump":[240],"operation.":[241],"Finally,":[242],"relate":[245],"notions":[251],"genericity":[253],"computably":[255],"comeager":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}