No Cover Image

Journal article 898 views 199 downloads

Overt choice

Matthew de Brecht, Arno Pauly Orcid Logo, Matthias Schröder

Computability, Volume: 9, Issue: 3-4, Pages: 169 - 191

Swansea University Author: Arno Pauly Orcid Logo

Check full text

DOI (Published version): 10.3233/com-190253

Abstract

We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by what open sets intersect it. We show that the question of whether overt choice is continuous for a given space is related t...

Full description

Published in: Computability
ISSN: 2211-3568 2211-3576
Published: IOS Press 2020
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa53986
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2020-04-18T19:46:06Z
last_indexed 2023-01-11T14:31:49Z
id cronfa53986
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-12-05T12:53:21.5359615</datestamp><bib-version>v2</bib-version><id>53986</id><entry>2020-04-18</entry><title>Overt choice</title><swanseaauthors><author><sid>17a56a78ec04e7fc47b7fe18394d7245</sid><ORCID>0000-0002-0173-3295</ORCID><firstname>Arno</firstname><surname>Pauly</surname><name>Arno Pauly</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2020-04-18</date><deptcode>SCS</deptcode><abstract>We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by what open sets intersect it. We show that the question of whether overt choice is continuous for a given space is related to topological completeness notions such as the Choquet-property; and to whether variants of Michael&#x2019;s selection theorem hold for that space. For spaces where overt choice is discontinuous it is interesting to explore the resulting Weihrauch degrees, which in turn are related to whether or not the space is Fr&#xE9;chet&#x2013;Urysohn.</abstract><type>Journal Article</type><journal>Computability</journal><volume>9</volume><journalNumber>3-4</journalNumber><paginationStart>169</paginationStart><paginationEnd>191</paginationEnd><publisher>IOS Press</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>2211-3568</issnPrint><issnElectronic>2211-3576</issnElectronic><keywords>Weihrauch reducibility, computable topology, quasi-Polish space</keywords><publishedDay>3</publishedDay><publishedMonth>8</publishedMonth><publishedYear>2020</publishedYear><publishedDate>2020-08-03</publishedDate><doi>10.3233/com-190253</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><funders/><projectreference/><lastEdited>2022-12-05T12:53:21.5359615</lastEdited><Created>2020-04-18T18:52:56.3921628</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Matthew de</firstname><surname>Brecht</surname><order>1</order></author><author><firstname>Arno</firstname><surname>Pauly</surname><orcid>0000-0002-0173-3295</orcid><order>2</order></author><author><firstname>Matthias</firstname><surname>Schr&#xF6;der</surname><order>3</order></author></authors><documents><document><filename>53986__17277__ef0e7cf9bdf646d2b97f181bf686d3e4.pdf</filename><originalFilename>1902.05926.pdf</originalFilename><uploaded>2020-05-18T13:36:31.2510435</uploaded><type>Output</type><contentLength>553688</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><copyrightCorrect>false</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2022-12-05T12:53:21.5359615 v2 53986 2020-04-18 Overt choice 17a56a78ec04e7fc47b7fe18394d7245 0000-0002-0173-3295 Arno Pauly Arno Pauly true false 2020-04-18 SCS We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by what open sets intersect it. We show that the question of whether overt choice is continuous for a given space is related to topological completeness notions such as the Choquet-property; and to whether variants of Michael’s selection theorem hold for that space. For spaces where overt choice is discontinuous it is interesting to explore the resulting Weihrauch degrees, which in turn are related to whether or not the space is Fréchet–Urysohn. Journal Article Computability 9 3-4 169 191 IOS Press 2211-3568 2211-3576 Weihrauch reducibility, computable topology, quasi-Polish space 3 8 2020 2020-08-03 10.3233/com-190253 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-12-05T12:53:21.5359615 2020-04-18T18:52:56.3921628 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Matthew de Brecht 1 Arno Pauly 0000-0002-0173-3295 2 Matthias Schröder 3 53986__17277__ef0e7cf9bdf646d2b97f181bf686d3e4.pdf 1902.05926.pdf 2020-05-18T13:36:31.2510435 Output 553688 application/pdf Accepted Manuscript true false
title Overt choice
spellingShingle Overt choice
Arno Pauly
title_short Overt choice
title_full Overt choice
title_fullStr Overt choice
title_full_unstemmed Overt choice
title_sort Overt choice
author_id_str_mv 17a56a78ec04e7fc47b7fe18394d7245
author_id_fullname_str_mv 17a56a78ec04e7fc47b7fe18394d7245_***_Arno Pauly
author Arno Pauly
author2 Matthew de Brecht
Arno Pauly
Matthias Schröder
format Journal article
container_title Computability
container_volume 9
container_issue 3-4
container_start_page 169
publishDate 2020
institution Swansea University
issn 2211-3568
2211-3576
doi_str_mv 10.3233/com-190253
publisher IOS Press
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by what open sets intersect it. We show that the question of whether overt choice is continuous for a given space is related to topological completeness notions such as the Choquet-property; and to whether variants of Michael’s selection theorem hold for that space. For spaces where overt choice is discontinuous it is interesting to explore the resulting Weihrauch degrees, which in turn are related to whether or not the space is Fréchet–Urysohn.
published_date 2020-08-03T04:07:15Z
_version_ 1763753523471712256
score 11.035634

Similar Items