In the traditional so-called Tarski's Truth Definition the semantics of first order logic is defined with respect to an assignment of values to the free variables. A richer family of semantic concepts can be modelled if semantics is defined with respect to a set (a "team") of such assignments. This is what is called team semantics, a term coined by the PI in his 2007 monograph, and used ever since to describe this highly non-trivial modification of Tarskian semantics. Team semantics was introduced around the same time in inquisitive logic under the name state semantics. Examples of semantic concepts available in team semantics but not in traditional Tarski semantics are the concepts of dependence and independence. The PI introduced what he called dependence logic around these concepts. It appears that teams appear naturally in several areas of sciences and humanities which has made it possible to apply dependence logic and its variants to these areas. Now is the right moment to move from dependence logic to a broader explication of team semantics. This is what the TEAMDEP project proposes to do. In the TEAMDEP project we take team semantics to a new level by focusing on its hard axiomatizability questions and to its applications to the foundations of quantum mechanics and to the multiverse of set theory.
Conditional
independence on semiring relations
Hannula,
Miika, arXiv
Information
inequality problem over set functions |
Hannula,
Miika, arXiv
Unified
Foundations of Team Semantics via Semirings, Timon
Barlag; Miika Hannula; Juha Kontinen; Nina Pardal; Jonni Virtema, Proceedings
of the 20th International Conference on Principles of Knowledge
Representation and Reasoning
Logics with
probabilistic team semantics and the Boolean negation,
Hannula,
Miika; Hirvonen, Minna; Kontinen, Juha; Mahmood, Yasir; Meier, Arne; Virtema,
Jonni, arXiv
SHELAH'S MAIN
GAP AND THE GENERALIZED BOREL REDUCIBILITY, Miguel Moreno, arXiv.
Axiomatizing modal inclusion logic and its variants, Aleksi Anttila, Matilda Häggblom, Fan Yang, arXiv.
Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna
Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, and Laura
Strieker. Logic and computation through the lens of semirings. CoRR,
abs/2502.12939, 2025.
Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna
Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, and Laura
Strieker. Logical approaches to non-deterministic polynomial time over
semirings. CoRR, abs/2509.26214, 2025.
Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, and Jonni
Virtema. Local consistency and axioms of functional dependence. CoRR,
abs/2505.11057, 2025.
Teemu Hankala, Miika Hannula, Yasir Mahmood, and Arne Meier. Parameterised complexity of consistent query answering via graph represen-
tations. CoRR, abs/2412.08324, 2024.
Miika Hannula, Minna Hirvonen, Juha Kontinen, and Sebastian Link.
Independence under incomplete information. To appear in FoIKS 2026.
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne
Meier, and Jonni Virtema. Logics with probabilistic team semantics and
the boolean negation. J. Log. Comput., 35(3), 2025.
Otto Rajala. An Inner Model from Stationary Logic and the Next Admissible Set. Dissertationes Universitatis Helsingiensis, 2025, 326. University of
Helsinki, Helsinki, 2025.
Miguel Moreno. Shelah's Main Gap and the generalized Borel-reducibility, submitted.
DOI: 10.48550/arXiv.2308.07510.
On Borel sets in ideal topologies. With Beatrice Pitton, submitted.
DOI: 10.48550/arXiv.2512.21140.
Orchid orcid.org/0000-0003-4356-7974
Google Scholar
Google Scholar
Address
|