No Cover Image

Conference Paper/Proceeding/Abstract 734 views 272 downloads

Continuous Team Semantics

Åsa Hirvonen, Juha Kontinen, Arno Pauly Orcid Logo

Theory and Applications of Models of Computation, Volume: 11436

Swansea University Author: Arno Pauly Orcid Logo

Check full text

DOI (Published version): 10.1007/978-3-030-14812-6_16

Abstract

We study logics with team semantics in computable metric spaces. We show how to define approximate versions of the usual independence/dependence atoms. For restricted classes of formulae, we show that we can assume w.l.o.g.~that teams are closed sets. This then allows us to import techniques from co...

Full description

Published in: Theory and Applications of Models of Computation
ISBN: 978-3-030-14811-9 978-3-030-14812-6
ISSN: 0302-9743 1611-3349
Published: Japan TAMC 2019 2019
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa49945
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2019-05-13T10:25:23Z
last_indexed 2019-06-28T14:52:45Z
id cronfa49945
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2019-06-28T13:24:51.4911754</datestamp><bib-version>v2</bib-version><id>49945</id><entry>2019-04-08</entry><title>Continuous Team Semantics</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>2019-04-08</date><deptcode>SCS</deptcode><abstract>We study logics with team semantics in computable metric spaces. We show how to define approximate versions of the usual independence/dependence atoms. For restricted classes of formulae, we show that we can assume w.l.o.g.~that teams are closed sets. This then allows us to import techniques from computable analysis to study the complexity of formula satisfaction and model checking.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Theory and Applications of Models of Computation</journal><volume>11436</volume><paginationEnd>278</paginationEnd><publisher>TAMC 2019</publisher><placeOfPublication>Japan</placeOfPublication><isbnPrint>978-3-030-14811-9</isbnPrint><isbnElectronic>978-3-030-14812-6</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords/><publishedDay>6</publishedDay><publishedMonth>3</publishedMonth><publishedYear>2019</publishedYear><publishedDate>2019-03-06</publishedDate><doi>10.1007/978-3-030-14812-6_16</doi><url>http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=79705&amp;amp;copyownerid=91906</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2019-06-28T13:24:51.4911754</lastEdited><Created>2019-04-08T16:28:15.2186382</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>&#xC5;sa</firstname><surname>Hirvonen</surname><order>1</order></author><author><firstname>Juha</firstname><surname>Kontinen</surname><order>2</order></author><author><firstname>Arno</firstname><surname>Pauly</surname><orcid>0000-0002-0173-3295</orcid><order>3</order></author></authors><documents><document><filename>0049945-08042019162932.pdf</filename><originalFilename>teamsemantics-tamc.pdf</originalFilename><uploaded>2019-04-08T16:29:32.7930000</uploaded><type>Output</type><contentLength>359434</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2020-03-06T00:00:00.0000000</embargoDate><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2019-06-28T13:24:51.4911754 v2 49945 2019-04-08 Continuous Team Semantics 17a56a78ec04e7fc47b7fe18394d7245 0000-0002-0173-3295 Arno Pauly Arno Pauly true false 2019-04-08 SCS We study logics with team semantics in computable metric spaces. We show how to define approximate versions of the usual independence/dependence atoms. For restricted classes of formulae, we show that we can assume w.l.o.g.~that teams are closed sets. This then allows us to import techniques from computable analysis to study the complexity of formula satisfaction and model checking. Conference Paper/Proceeding/Abstract Theory and Applications of Models of Computation 11436 278 TAMC 2019 Japan 978-3-030-14811-9 978-3-030-14812-6 0302-9743 1611-3349 6 3 2019 2019-03-06 10.1007/978-3-030-14812-6_16 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=79705&amp;copyownerid=91906 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2019-06-28T13:24:51.4911754 2019-04-08T16:28:15.2186382 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Åsa Hirvonen 1 Juha Kontinen 2 Arno Pauly 0000-0002-0173-3295 3 0049945-08042019162932.pdf teamsemantics-tamc.pdf 2019-04-08T16:29:32.7930000 Output 359434 application/pdf Accepted Manuscript true 2020-03-06T00:00:00.0000000 true eng
title Continuous Team Semantics
spellingShingle Continuous Team Semantics
Arno Pauly
title_short Continuous Team Semantics
title_full Continuous Team Semantics
title_fullStr Continuous Team Semantics
title_full_unstemmed Continuous Team Semantics
title_sort Continuous Team Semantics
author_id_str_mv 17a56a78ec04e7fc47b7fe18394d7245
author_id_fullname_str_mv 17a56a78ec04e7fc47b7fe18394d7245_***_Arno Pauly
author Arno Pauly
author2 Åsa Hirvonen
Juha Kontinen
Arno Pauly
format Conference Paper/Proceeding/Abstract
container_title Theory and Applications of Models of Computation
container_volume 11436
publishDate 2019
institution Swansea University
isbn 978-3-030-14811-9
978-3-030-14812-6
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-030-14812-6_16
publisher TAMC 2019
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://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=79705&amp;copyownerid=91906
document_store_str 1
active_str 0
description We study logics with team semantics in computable metric spaces. We show how to define approximate versions of the usual independence/dependence atoms. For restricted classes of formulae, we show that we can assume w.l.o.g.~that teams are closed sets. This then allows us to import techniques from computable analysis to study the complexity of formula satisfaction and model checking.
published_date 2019-03-06T04:01:13Z
_version_ 1763753143581016064
score 11.014067

Similar Items