No Cover Image

Conference Paper/Proceeding/Abstract 983 views

Descriptive Set Theory in the Category of Represented Spaces

Arno Pauly Orcid Logo, Matthew De Brecht

2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, Pages: 438 - 449

Swansea University Author: Arno Pauly Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1109/lics.2015.48

Abstract

We propose to extend descriptive set theory (DST)beyond its traditional setting of Polish spaces to the representedspaces. There, we can reformulate DST in terms of endofunctorson the categories of represented spaces and computable orcontinuous functions. In particular, this approach satisfies thede...

Full description

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
ISBN: 9781479988754
ISSN: 1043-6871
Published: IEEE 2015
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa36020
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2017-10-11T13:17:32Z
last_indexed 2021-01-29T03:55:26Z
id cronfa36020
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2021-01-28T13:03:35.3789106</datestamp><bib-version>v2</bib-version><id>36020</id><entry>2017-10-11</entry><title>Descriptive Set Theory in the Category of Represented Spaces</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>2017-10-11</date><deptcode>SCS</deptcode><abstract>We propose to extend descriptive set theory (DST)beyond its traditional setting of Polish spaces to the representedspaces. There, we can reformulate DST in terms of endofunctorson the categories of represented spaces and computable orcontinuous functions. In particular, this approach satisfies thedemand for a uniform approach to both classic and effectiveDST &#x2013; computability follows naturally from the setting, ratherthan having to be explicitly demanded.The previous endeavour to extend DST to the Quasi-Polishspaces is subsumed by this work. In several cases the category-theoretic setting enables new, very succinct proofs; and sheds anew light on *why* certain results are true. The framework lets usmake formal some natural questions not easily approachable bytraditional methods.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science</journal><volume/><journalNumber/><paginationStart>438</paginationStart><paginationEnd>449</paginationEnd><publisher>IEEE</publisher><placeOfPublication/><isbnPrint/><isbnElectronic>9781479988754</isbnElectronic><issnPrint>1043-6871</issnPrint><issnElectronic/><keywords>descriptive set theory, cartesian closed categories, computable analysis</keywords><publishedDay>1</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2015</publishedYear><publishedDate>2015-07-01</publishedDate><doi>10.1109/lics.2015.48</doi><url>http://dx.doi.org/10.1109/lics.2015.48</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2021-01-28T13:03:35.3789106</lastEdited><Created>2017-10-11T11:56:12.4650753</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>Arno</firstname><surname>Pauly</surname><orcid>0000-0002-0173-3295</orcid><order>1</order></author><author><firstname>Matthew De</firstname><surname>Brecht</surname><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2021-01-28T13:03:35.3789106 v2 36020 2017-10-11 Descriptive Set Theory in the Category of Represented Spaces 17a56a78ec04e7fc47b7fe18394d7245 0000-0002-0173-3295 Arno Pauly Arno Pauly true false 2017-10-11 SCS We propose to extend descriptive set theory (DST)beyond its traditional setting of Polish spaces to the representedspaces. There, we can reformulate DST in terms of endofunctorson the categories of represented spaces and computable orcontinuous functions. In particular, this approach satisfies thedemand for a uniform approach to both classic and effectiveDST – computability follows naturally from the setting, ratherthan having to be explicitly demanded.The previous endeavour to extend DST to the Quasi-Polishspaces is subsumed by this work. In several cases the category-theoretic setting enables new, very succinct proofs; and sheds anew light on *why* certain results are true. The framework lets usmake formal some natural questions not easily approachable bytraditional methods. Conference Paper/Proceeding/Abstract 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science 438 449 IEEE 9781479988754 1043-6871 descriptive set theory, cartesian closed categories, computable analysis 1 7 2015 2015-07-01 10.1109/lics.2015.48 http://dx.doi.org/10.1109/lics.2015.48 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2021-01-28T13:03:35.3789106 2017-10-11T11:56:12.4650753 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Arno Pauly 0000-0002-0173-3295 1 Matthew De Brecht 2
title Descriptive Set Theory in the Category of Represented Spaces
spellingShingle Descriptive Set Theory in the Category of Represented Spaces
Arno Pauly
title_short Descriptive Set Theory in the Category of Represented Spaces
title_full Descriptive Set Theory in the Category of Represented Spaces
title_fullStr Descriptive Set Theory in the Category of Represented Spaces
title_full_unstemmed Descriptive Set Theory in the Category of Represented Spaces
title_sort Descriptive Set Theory in the Category of Represented Spaces
author_id_str_mv 17a56a78ec04e7fc47b7fe18394d7245
author_id_fullname_str_mv 17a56a78ec04e7fc47b7fe18394d7245_***_Arno Pauly
author Arno Pauly
author2 Arno Pauly
Matthew De Brecht
format Conference Paper/Proceeding/Abstract
container_title 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
container_start_page 438
publishDate 2015
institution Swansea University
isbn 9781479988754
issn 1043-6871
doi_str_mv 10.1109/lics.2015.48
publisher IEEE
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
url http://dx.doi.org/10.1109/lics.2015.48
document_store_str 0
active_str 0
description We propose to extend descriptive set theory (DST)beyond its traditional setting of Polish spaces to the representedspaces. There, we can reformulate DST in terms of endofunctorson the categories of represented spaces and computable orcontinuous functions. In particular, this approach satisfies thedemand for a uniform approach to both classic and effectiveDST – computability follows naturally from the setting, ratherthan having to be explicitly demanded.The previous endeavour to extend DST to the Quasi-Polishspaces is subsumed by this work. In several cases the category-theoretic setting enables new, very succinct proofs; and sheds anew light on *why* certain results are true. The framework lets usmake formal some natural questions not easily approachable bytraditional methods.
published_date 2015-07-01T03:44:59Z
_version_ 1763752122178863104
score 11.035634

Similar Items