On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics

10/14/2019
by   Matthias Hoelzel, et al.
0

We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables the handling and provides a better understanding of this fragment. We also introduce inclusion-exclusion games that turn out to be precisely the corresponding model-checking games. These games are not only interesting in their own right, but they also are a key factor towards building a bridge between the semantic and syntactic fragments. On the level of logics with team semantics we additionally present restrictions of inclusion-exclusion logic to capture the union closed fragment. Moreover, we define a team based atom that when adding it to first-order logic also precisely captures the union closed fragment of existential second-order logic which answers an open question by Galliani and Hella.

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
12/23/2020

Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

Probabilistic team semantics is a framework for logical analysis of prob...
research
02/14/2018

On completeness and parametricity in the realizability semantics of System F

A general approach to the realizability semantics of System F is obtaine...
research
12/30/2019

The Challenge of Unifying Semantic and Syntactic Inference Restrictions

While syntactic inference restrictions don't play an important role for ...
research
09/10/2018

Model Theory of Monadic Predicate Logic with the Infinity Quantifier

This paper establishes model-theoretic properties of FOE^∞, a variation ...
research
02/01/2019

Counting of Teams in First-Order Team Logics

We study descriptive complexity of counting complexity classes in the ra...
research
11/15/2014

Using Description Logics for RDF Constraint Checking and Closed-World Recognition

RDF and Description Logics work in an open-world setting where absence o...

Please sign up or login with your details

Forgot password? Click here to reset