Safe Dependency Atoms and Possibility Operators in Team Semantics

08/02/2018
by   Pietro Galliani, et al.
0

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 when added to it. I show that some dependencies, like totality, non-constancy and non-emptiness, are safe for all logics FO( D), and that other dependencies, like constancy, are not safe for FO( D) for some choices of D despite being strongly first order (that is, safe for FO(∅)). I furthermore show that the possibility operator ϕ, which holds in a team if and only if ϕ holds in some nonempty subteam, can be added to any logic FO( D) without increasing its expressive power.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2021

On the Expressive Power of TeamLTL and First-Order Team Logic over Hyperproperties

In this article we study linear temporal logics with team semantics (Tea...
research
11/19/2020

Logics with Multiteam Semantics

Team semantics is the mathematical basis of modern logics of dependence ...
research
03/14/2023

Unified Foundations of Team Semantics via Semirings

Semiring semantics for first-order logic provides a way to trace how fac...
research
04/09/2021

On elementary logics for quantitative dependencies

We define and study logics in the framework of probabilistic team semant...
research
03/06/2018

Probabilistic team semantics

Team semantics is a semantical framework for the study of dependence and...
research
12/14/2018

Facets of Distribution Identities in Probabilistic Team Semantics

We study probabilistic team semantics which is a semantical framework al...
research
03/14/2019

LIKE Patterns and Complexity

We investigate the expressive power and complexity questions for the LIK...

Please sign up or login with your details

Forgot password? Click here to reset