A comparison of concepts from computable analysis and effective descriptive set theory
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this pap...
Gespeichert in:
Veröffentlicht in: | Mathematical structures in computer science 2017-12, Vol.27 (8), p.1414-1436 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1436 |
---|---|
container_issue | 8 |
container_start_page | 1414 |
container_title | Mathematical structures in computer science |
container_volume | 27 |
creator | GREGORIADES, VASSILIOS KISPÉTER, TAMÁS PAULY, ARNO |
description | Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail. |
doi_str_mv | 10.1017/S0960129516000128 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1965536616</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0960129516000128</cupid><sourcerecordid>1965536616</sourcerecordid><originalsourceid>FETCH-LOGICAL-c426t-99ec381e539a9d88b17e4beb3ca6c9bcac3dcd7c96f083b95c3667a359926dda3</originalsourceid><addsrcrecordid>eNp1kM1LAzEQxYMoWKt_gLeA59Vk081ujqWoFQoe_LguyWSiW7rNmqRC_3vTj4MgnuYN7_eG4RFyzdktZ7y-e2FKMl6qikvGsmhOyIhPpCoaVpenZLSzi51_Ti5iXGZEcKZG5H1KwfeDDl30a-pd3taAQ4rUBd_vvU3SZoVUr_VqG7uYhaXoHELqvpFajBC6Ya8jJpo-0YftJTlzehXx6jjH5O3h_nU2LxbPj0-z6aKASSlToRSCaDhWQmllm8bwGicGjQAtQRnQICzYGpR0rBFGVSCkrLWolCqltVqMyc3h7hD81wZjapd-E_KnseVKVlXGucwUP1AQfIwBXTuErtdh23LW7upr_9SXM-KY0b0Jnf3AX6f_Tf0AbgJy3w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1965536616</pqid></control><display><type>article</type><title>A comparison of concepts from computable analysis and effective descriptive set theory</title><source>Cambridge University Press Journals Complete</source><creator>GREGORIADES, VASSILIOS ; KISPÉTER, TAMÁS ; PAULY, ARNO</creator><creatorcontrib>GREGORIADES, VASSILIOS ; KISPÉTER, TAMÁS ; PAULY, ARNO</creatorcontrib><description>Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.</description><identifier>ISSN: 0960-1295</identifier><identifier>EISSN: 1469-8072</identifier><identifier>DOI: 10.1017/S0960129516000128</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Set theory</subject><ispartof>Mathematical structures in computer science, 2017-12, Vol.27 (8), p.1414-1436</ispartof><rights>Copyright © Cambridge University Press 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c426t-99ec381e539a9d88b17e4beb3ca6c9bcac3dcd7c96f083b95c3667a359926dda3</citedby><cites>FETCH-LOGICAL-c426t-99ec381e539a9d88b17e4beb3ca6c9bcac3dcd7c96f083b95c3667a359926dda3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0960129516000128/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,776,780,27901,27902,55603</link.rule.ids></links><search><creatorcontrib>GREGORIADES, VASSILIOS</creatorcontrib><creatorcontrib>KISPÉTER, TAMÁS</creatorcontrib><creatorcontrib>PAULY, ARNO</creatorcontrib><title>A comparison of concepts from computable analysis and effective descriptive set theory</title><title>Mathematical structures in computer science</title><addtitle>Math. Struct. Comp. Sci</addtitle><description>Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.</description><subject>Set theory</subject><issn>0960-1295</issn><issn>1469-8072</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kM1LAzEQxYMoWKt_gLeA59Vk081ujqWoFQoe_LguyWSiW7rNmqRC_3vTj4MgnuYN7_eG4RFyzdktZ7y-e2FKMl6qikvGsmhOyIhPpCoaVpenZLSzi51_Ti5iXGZEcKZG5H1KwfeDDl30a-pd3taAQ4rUBd_vvU3SZoVUr_VqG7uYhaXoHELqvpFajBC6Ya8jJpo-0YftJTlzehXx6jjH5O3h_nU2LxbPj0-z6aKASSlToRSCaDhWQmllm8bwGicGjQAtQRnQICzYGpR0rBFGVSCkrLWolCqltVqMyc3h7hD81wZjapd-E_KnseVKVlXGucwUP1AQfIwBXTuErtdh23LW7upr_9SXM-KY0b0Jnf3AX6f_Tf0AbgJy3w</recordid><startdate>20171201</startdate><enddate>20171201</enddate><creator>GREGORIADES, VASSILIOS</creator><creator>KISPÉTER, TAMÁS</creator><creator>PAULY, ARNO</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20171201</creationdate><title>A comparison of concepts from computable analysis and effective descriptive set theory</title><author>GREGORIADES, VASSILIOS ; KISPÉTER, TAMÁS ; PAULY, ARNO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c426t-99ec381e539a9d88b17e4beb3ca6c9bcac3dcd7c96f083b95c3667a359926dda3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Set theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GREGORIADES, VASSILIOS</creatorcontrib><creatorcontrib>KISPÉTER, TAMÁS</creatorcontrib><creatorcontrib>PAULY, ARNO</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Mathematical structures in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GREGORIADES, VASSILIOS</au><au>KISPÉTER, TAMÁS</au><au>PAULY, ARNO</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A comparison of concepts from computable analysis and effective descriptive set theory</atitle><jtitle>Mathematical structures in computer science</jtitle><addtitle>Math. Struct. Comp. Sci</addtitle><date>2017-12-01</date><risdate>2017</risdate><volume>27</volume><issue>8</issue><spage>1414</spage><epage>1436</epage><pages>1414-1436</pages><issn>0960-1295</issn><eissn>1469-8072</eissn><abstract>Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0960129516000128</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0960-1295 |
ispartof | Mathematical structures in computer science, 2017-12, Vol.27 (8), p.1414-1436 |
issn | 0960-1295 1469-8072 |
language | eng |
recordid | cdi_proquest_journals_1965536616 |
source | Cambridge University Press Journals Complete |
subjects | Set theory |
title | A comparison of concepts from computable analysis and effective descriptive set theory |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T23%3A54%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20comparison%20of%20concepts%20from%20computable%20analysis%20and%20effective%20descriptive%20set%20theory&rft.jtitle=Mathematical%20structures%20in%20computer%20science&rft.au=GREGORIADES,%20VASSILIOS&rft.date=2017-12-01&rft.volume=27&rft.issue=8&rft.spage=1414&rft.epage=1436&rft.pages=1414-1436&rft.issn=0960-1295&rft.eissn=1469-8072&rft_id=info:doi/10.1017/S0960129516000128&rft_dat=%3Cproquest_cross%3E1965536616%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1965536616&rft_id=info:pmid/&rft_cupid=10_1017_S0960129516000128&rfr_iscdi=true |