{"id":"https://openalex.org/W2151637386","doi":"https://doi.org/10.2168/lmcs-4(3:3)2008","title":"Exhaustible sets in higher-type computation","display_name":"Exhaustible sets in higher-type computation","publication_year":2008,"publication_date":"2008-08-27","ids":{"openalex":"https://openalex.org/W2151637386","doi":"https://doi.org/10.2168/lmcs-4(3:3)2008","mag":"2151637386"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(3:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:3)2008","pdf_url":"https://lmcs.episciences.org/693/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/693/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050767630","display_name":"Mart\u0131\u0301n H\u00f6tzel Escard\u00f3","orcid":"https://orcid.org/0000-0002-4091-6334"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Escardo","raw_affiliation_strings":["School of Computer Science, University of Birmingham, B15 2TT, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050767630"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":4.5275,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.94628225,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 4, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991999864578247,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991999864578247,"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.9819999933242798,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9790999889373779,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.6081668734550476},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5818783640861511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5315454006195068},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5252106785774231},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.4995143413543701},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.45870622992515564},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4576387405395508},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4554356038570404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44745391607284546},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4117949306964874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4052048623561859},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34511110186576843},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2416059374809265}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.6081668734550476},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5818783640861511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5315454006195068},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5252106785774231},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.4995143413543701},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.45870622992515564},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4576387405395508},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4554356038570404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44745391607284546},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4117949306964874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4052048623561859},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34511110186576843},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2416059374809265},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.2168/lmcs-4(3:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:3)2008","pdf_url":"https://lmcs.episciences.org/693/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0808.0441","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0808.0441","pdf_url":"https://arxiv.org/pdf/0808.0441","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:CiteSeerX.psu:10.1.1.314.4022","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.4022","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0808.0441v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.314.563","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0808.0441v2.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:ed57ddc2f1214e0f9acccc8e6f76db83","is_oa":true,"landing_page_url":"https://doaj.org/article/ed57ddc2f1214e0f9acccc8e6f76db83","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9d6bebf7-778d-4cf5-a1d9-2200375d2d72","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/9d6bebf7-778d-4cf5-a1d9-2200375d2d72","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Escardo, M 2008, 'Exhaustible sets in higher-type computation', Logical Methods in Computer Science, vol. 4, no. 3, 3, pp. 37 pages. https://doi.org/10.2168/LMCS-4(3:3)2008","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/9d6bebf7-778d-4cf5-a1d9-2200375d2d72","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/exhaustible-sets-in-highertype-computation(9d6bebf7-778d-4cf5-a1d9-2200375d2d72).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Escardo, M 2008, 'Exhaustible sets in higher-type computation', Logical Methods in Computer Science, vol. 4, no. 3, 3, pp. 37 pages. https://doi.org/10.2168/LMCS-4(3:3)2008","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(3:3)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(3:3)2008","pdf_url":"https://lmcs.episciences.org/693/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2151637386.pdf","grobid_xml":"https://content.openalex.org/works/W2151637386.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W29563611","https://openalex.org/W92818225","https://openalex.org/W126568045","https://openalex.org/W130842658","https://openalex.org/W242489048","https://openalex.org/W1484625174","https://openalex.org/W1503914388","https://openalex.org/W1507693023","https://openalex.org/W1515039666","https://openalex.org/W1525647423","https://openalex.org/W1538667139","https://openalex.org/W1553992341","https://openalex.org/W1653897855","https://openalex.org/W1966478469","https://openalex.org/W1975597184","https://openalex.org/W1993746530","https://openalex.org/W2007270285","https://openalex.org/W2012644590","https://openalex.org/W2016385284","https://openalex.org/W2019980137","https://openalex.org/W2067914884","https://openalex.org/W2069246348","https://openalex.org/W2072497723","https://openalex.org/W2073030937","https://openalex.org/W2077809881","https://openalex.org/W2091058403","https://openalex.org/W2093541252","https://openalex.org/W2094670595","https://openalex.org/W2110195431","https://openalex.org/W2111656596","https://openalex.org/W2112131178","https://openalex.org/W2119811631","https://openalex.org/W2134743979","https://openalex.org/W2141746484","https://openalex.org/W2148084455","https://openalex.org/W2154273644","https://openalex.org/W2318815169","https://openalex.org/W2611511037","https://openalex.org/W2914212232","https://openalex.org/W3104857306","https://openalex.org/W4239316923","https://openalex.org/W4248809944","https://openalex.org/W6631533854","https://openalex.org/W6669851553"],"related_works":["https://openalex.org/W2156140706","https://openalex.org/W2101752691","https://openalex.org/W2140392112","https://openalex.org/W2094354112","https://openalex.org/W2067699663","https://openalex.org/W2554316162","https://openalex.org/W2092155908","https://openalex.org/W3192943071","https://openalex.org/W2803365029","https://openalex.org/W1602107066"],"abstract_inverted_index":{"We":[0,97,137,163],"say":[1],"that":[2,68,99,131],"a":[3,86,94,139,148,152],"set":[4],"is":[5,23,44,56,124,186],"exhaustible":[6,132,143,191],"if":[7,21],"it":[8],"admits":[9],"algorithmic":[10],"universal":[11],"quantification":[12,95],"for":[13,35,73],"continuous":[14,29,83],"predicates":[15],"in":[16,79,167],"finite":[17,118],"time,":[18],"and":[19,65,109,116,119,192],"searchable":[20,100,193],"there":[22,43],"an":[24,33],"algorithm":[25],"that,":[26,166],"given":[27],"any":[28],"predicate,":[30],"either":[31],"selects":[32],"element":[34],"which":[36],"the":[37,69,80,111,127,168,174,178,188],"predicate":[38],"holds":[39,72],"or":[40],"else":[41],"tells":[42],"no":[45],"example.":[46],"The":[47,181],"Cantor":[48,179],"space":[49],"of":[50,53,75,82,113,117,142,151,157,160,177,183,190],"infinite":[51,121],"sequences":[52],"binary":[54],"digits":[55],"known":[57],"to":[58,126],"be":[59,90],"searchable.":[60],"Searchable":[61],"sets":[62,74,101,133,145],"are":[63,102,134,172],"exhaustible,":[64],"we":[66,196],"show":[67,165],"converse":[70],"also":[71,164,197],"hereditarily":[76],"total":[77,144],"elements":[78],"hierarchy":[81],"functionals;":[84],"moreover,":[85],"selection":[87],"functional":[88],"can":[89],"constructed":[91],"uniformly":[92],"from":[93],"functional.":[96],"prove":[98],"closed":[103],"under":[104,110],"intersections":[105],"with":[106],"decidable":[107],"sets,":[108,194],"formation":[112],"computable":[114,175],"images":[115,176],"countably":[120],"products.":[122],"This":[123],"related":[125],"fact,":[128],"established":[129],"here,":[130],"topologically":[135],"compact.":[136],"obtain":[138],"complete":[140],"description":[141],"by":[146],"developing":[147],"computational":[149],"version":[150],"topological":[153],"Arzela--Ascoli":[154],"type":[155],"characterization":[156],"compact":[158],"subsets":[159],"function":[161],"spaces.":[162],"non-empty":[169],"case,":[170],"they":[171],"precisely":[173],"space.":[180],"emphasis":[182],"this":[184],"paper":[185],"on":[187],"theory":[189],"but":[195],"briefly":[198],"sketch":[199],"applications.":[200]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2020-11-23T00:00:00"}