Jan 21, 2015 · We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to ...

In this article we study two-variable fragments of logics based on team semantics. Team semantics was originally conceived in [13] in the context of ...

Oct 19, 2014 · We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion ...

Juha Kontinen, Antti Kuusisto, Jonni Virtema: Decidable Fragments of Logics Based on Team Semantics. CoRR abs/1410.5037 (2014). manage site settings.

Dec 20, 2018 · A decidable fragment of first-order logic is a syntactically-restricted subset of first-order logic in which truth is computable.

Abstract. We study the complexity of predicate logics based on team semantics. We show that the satis- fiability problems of two-variable independence logic ...

For both theoretical and practical purposes it is interesting to classify fragments of separation logic for which such problems become decidable, and to ...

The paper shows that true arithmetic is interpretable in FOTPI whereas probabilistic independence logic is by our results far less complex. Page 3. Logics with ...

In this thesis we study the expressive power of various logics with team semantics; such as inclusion, exclusion, dependence and nondependence logics.

Aug 19, 2016 · We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence ...