Decidability of predicate logics with team semantics

DOI10.4230/LIPIcs.MFCS.2016.60zbMath1398.03064arXiv1410.5037OpenAlexW2964080799MaRDI QIDQ4608623

Antti Kuusisto, Jonni Virtema, Juha Kontinen

Publication date: 21 March 2018

Full work available at URL: https://arxiv.org/abs/1410.5037

zbMATH Keywords

complexitydependence logicteam semanticstwo-variable logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (10)

Doubly strongly first order dependencies ⋮ On definability of team relations with \(k\)-invariant atoms ⋮ Embedding causal team languages into predicate logic ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Unnamed Item ⋮ On the complexity of team logic and its two-variable fragment ⋮ Approximation and dependence via multiteam semantics ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Expressivity and Complexity of Dependence Logic ⋮ Counting of Teams in First-Order Team Logics

This page was built for publication: Decidability of predicate logics with team semantics