No Cover Image

Conference Paper/Proceeding/Abstract 700 views 265 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!
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.
College: Faculty of Science and Engineering
End Page: 278

Similar Items