Safe Dependency Atoms and Possibility Operators in Team Semantics
I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it. I show that some dependencies, like totality, non-constancy and non-emptiness, are safe for all logics FO(D), an...
Main Author: | Pietro Galliani |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2018-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1808.00710v2 |
Similar Items
-
Upwards Closed Dependencies in Team Semantics
by: Pietro Galliani
Published: (2013-07-01) -
Operational Semantics for PLEX : A Basis for Safe Parallelization
by: Lindhult, Johan
Published: (2008) -
Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case
by: Pietro Galliani
Published: (2019-09-01) -
Typed Operational Semantics for Dependent Record Types
by: Yangyue Feng, et al.
Published: (2011-03-01) -
Tractability Frontier of Data Complexity in Team Semantics
by: Arnaud Durand, et al.
Published: (2015-09-01)