The hierarchy theorem for second order generalized quantifiers. - Juha Kontinen (J. Symb. Log., 2006)

On Second-Order Monadic Groupoidal Quantifiers. - Juha Kontinen; Heribert Vollmer (WoLLIC, 2008)

A Remark on Collective Quantification. - Juha Kontinen; Jakub Szymanik (J. Log. Lang. Inf., 2008)

On Definability in Dependence Logic. - Juha Kontinen; Jouko A. Väänänen (J. Log. Lang. Inf., 2009)

A logical characterization of the counting hierarchy. - Juha Kontinen (ACM Trans. Comput. Log., 2009)

Definability of second order generalized quantifiers. - Juha Kontinen (Arch. Math. Log., 2010)

On Second-Order Monadic Monoidal and Groupoidal Quantifiers - Juha Kontinen; Heribert Vollmer (Log. Methods Comput. Sci., 2010)

Characterizing Definability of Second-Order Generalized Quantifiers. - Juha Kontinen; Jakub Szymanik (WoLLIC, 2011)

Team Logic and Second-Order Logic. - Juha Kontinen; Ville Nurmi (Fundam. Informaticae, 2011)

Extensions of MSO and the monadic counting hierarchy. - Juha Kontinen; Hannu Niemistö (Inf. Comput., 2011)

Erratum to: On Definability in Dependence Logic. - Juha Kontinen; Jouko A. Väänänen (J. Log. Lang. Inf., 2011)

A Remark on Negation in Dependence Logic. - Juha Kontinen; Jouko A. Väänänen (Notre Dame J. Formal Log., 2011)

Hierarchies in Dependence Logic. - Arnaud Durand 001; Juha Kontinen (ACM Trans. Comput. Log., 2012)

Hierarchies in independence logic. - Pietro Galliani; Miika Hannula; Juha Kontinen (CSL, 2013)

Independence in Database Relations. - Juha Kontinen; Sebastian Link; Jouko A. Väänänen (WoLLIC, 2013)

Axiomatizing first-order consequences in dependence logic. - Juha Kontinen; Jouko A. Väänänen (Ann. Pure Appl. Log., 2013)

Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). - Samson Abramsky; Juha Kontinen; Jouko A. Väänänen; Heribert Vollmer (Dagstuhl Reports, 2013)

Characterizing quantifier extensions of dependence logic. - Fredrik Engström; Juha Kontinen (J. Symb. Log., 2013)

Editorial Introduction. - Juha Kontinen; Jouko A. Väänänen; Dag Westerståhl (Stud Logica, 2013)

On Independence Atoms and Keys. - Miika Hannula; Juha Kontinen; Sebastian Link (CIKM, 2014)

Decidable Fragments of Logics Based on Team Semantics. - Juha Kontinen; Antti Kuusisto; Jonni Virtema (CoRR, 2014)

A Fragment of Dependence Logic Capturing Polynomial Time - Johannes Ebbing; Juha Kontinen; Julian-Steffen Müller; Heribert Vollmer (Log. Methods Comput. Sci., 2014)

Complexity of two-variable dependence logic and IF-logic. - Juha Kontinen; Antti Kuusisto; Peter Lohmann; Jonni Virtema (Inf. Comput., 2014)

A characterization of definability of second-order generalized quantifiers with applications to non-definability. - Juha Kontinen; Jakub Szymanik (J. Comput. Syst. Sci., 2014)

From the editors. - Åsa Hirvonen; Juha Kontinen; Roman Kossak; Andrés Villaveces (Logic Without Borders, 2015)

On Natural Deduction in Dependence Logic. - Juha Kontinen (Logic Without Borders, 2015)

A Van Benthem Theorem for Modal Team Semantics. - Juha Kontinen; Julian-Steffen Müller; Henning Schnoor; Heribert Vollmer (CSL, 2015)

Complexity of Propositional Independence and Inclusion Logic. - Miika Hannula; Juha Kontinen; Jonni Virtema; Heribert Vollmer (MFCS (1), 2015)

Tractability Frontier of Data Complexity in Team Semantics. - Arnaud Durand 001; Juha Kontinen; Nicolas de Rugy-Altherre; Jouko Väänänen (GandALF, 2015)

Logics for Dependence and Independence (Dagstuhl Seminar 15261). - Erich Grädel; Juha Kontinen; Jouko Väänänen; Heribert Vollmer (Dagstuhl Reports, 2015)

Dependence Logic with a Majority Quantifier. - Arnaud Durand 001; Johannes Ebbing; Juha Kontinen; Heribert Vollmer (J. Log. Lang. Inf., 2015)

Hierarchies in independence and inclusion logic with strict semantics. - Miika Hannula; Juha Kontinen (J. Log. Comput., 2015)

Expressivity and Complexity of Dependence Logic. - Arnaud Durand 001; Juha Kontinen; Heribert Vollmer (Dependence Logic, 2016)

Introduction. - Samson Abramsky; Juha Kontinen; Jouko Väänänen; Heribert Vollmer (Dependence Logic, 2016)

Descriptive Complexity of #AC0 Functions. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (CSL, 2016)

Decidability of Predicate Logics with Team Semantics. - Juha Kontinen; Antti Kuusisto; Jonni Virtema (MFCS, 2016)

On Quantified Propositional Logics and the Exponential Time Hierarchy. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (GandALF, 2016)

A finite axiomatization of conditional independence and inclusion dependencies. - Miika Hannula; Juha Kontinen (Inf. Comput., 2016)

On the finite and general implication problems of independence atoms and keys. - Miika Hannula; Juha Kontinen; Sebastian Link (J. Comput. Syst. Sci., 2016)

On the Interaction of Inclusion Dependencies with Independence Atoms. - Miika Hannula; Juha Kontinen; Sebastian Link (LPAR, 2017)

Computational Aspects of Logics in Team Semantics (Tutorial). - Juha Kontinen (STACS, 2017)

Dependence logic with generalized quantifiers: Axiomatizations. - Fredrik Engström; Juha Kontinen; Jouko Väänänen (J. Comput. Syst. Sci., 2017)

Modal independence logic. - Juha Kontinen; Julian-Steffen Müller; Henning Schnoor; Heribert Vollmer (J. Log. Comput., 2017)

Probabilistic Team Semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (FoIKS, 2018)

Structure Learning for Bayesian Networks over Labeled DAGs. - Antti Hyttinen; Johan Pensar; Juha Kontinen; Jukka Corander (PGM, 2018)

Approximation and dependence via multiteam semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (Ann. Math. Artif. Intell., 2018)

Complexity of Propositional Logics in Team Semantic. - Miika Hannula; Juha Kontinen; Jonni Virtema; Heribert Vollmer (ACM Trans. Comput. Log., 2018)

Facets of Distribution Identities in Probabilistic Team Semantics. - Miika Hannula; Åsa Hirvonen; Juha Kontinen; Vadim Kulikov; Jonni Virtema (JELIA, 2019)

Counting of Teams in First-Order Team Logics. - Anselm Haak; Juha Kontinen; Fabian Müller 003; Heribert Vollmer; Fan Yang 004 (MFCS, 2019)

Continuous Team Semantics. - Åsa Hirvonen; Juha Kontinen; Arno Pauly (TAMC, 2019)

Logics for First-Order Team Properties. - Juha Kontinen; Fan Yang 004 (WoLLIC, 2019)

A logical approach to context-specific independence. - Jukka Corander; Antti Hyttinen; Juha Kontinen; Johan Pensar; Jouko Väänänen (Ann. Pure Appl. Log., 2019)

Logics for Dependence and Independence (Dagstuhl Seminar 19031). - Erich Grädel; Phokion G. Kolaitis; Juha Kontinen; Heribert Vollmer (Dagstuhl Reports, 2019)

Descriptive complexity of real computation and probabilistic independence logic. - Miika Hannula; Juha Kontinen; Jan Van den Bussche; Jonni Virtema (LICS, 2020)

Polyteam semantics. - Miika Hannula; Juha Kontinen; Jonni Virtema (J. Log. Comput., 2020)

On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (CSL, 2021)

Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity. - Jonni Virtema; Jana Hofmann; Bernd Finkbeiner; Juha Kontinen; Fan Yang 004 (FSTTCS, 2021)

On the Expressive Power of TeamLTL and First-Order Team Logic over Hyperproperties. - Juha Kontinen; Max Sandström (WoLLIC, 2021)

On the Interaction of Functional and Inclusion Dependencies with Independence Atoms. - Miika Hannula; Juha Kontinen; Sebastian Link (CoRR, 2021)

Descriptive complexity of #P functions: A new perspective. - Arnaud Durand 001; Anselm Haak; Juha Kontinen; Heribert Vollmer (J. Comput. Syst. Sci., 2021)

A Parameterized View on the Complexity of Dependence Logic. - Juha Kontinen; Arne Meier; Yasir Mahmood 002 (LFCS, 2022)

Preface. - Andreas Herzig; Juha Kontinen (Ann. Math. Artif. Intell., 2022)

On elementary logics for quantitative dependencies. - Miika Hannula; Minna Hirvonen; Juha Kontinen (Ann. Pure Appl. Log., 2022)

A parameterized view on the complexity of dependence and independence logic. - Juha Kontinen; Arne Meier; Yasir Mahmood 002 (J. Log. Comput., 2022)

Unified Foundations of Team Semantics via Semirings. - Timon Barlag; Miika Hannula; Juha Kontinen; Nina Pardal; Jonni Virtema (KR, 2023)

Regular Representations of Uniform TC^0. - Lauri Hella; Juha Kontinen; Kerkko Luosto (CoRR, 2023)

Complete Logics for Elementary Team Properties. - Juha Kontinen; Fan Yang 004 (J. Symb. Log., 2023)

Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions. - Teemu Hankala; Miika Hannula; Juha Kontinen; Jonni Virtema (AAAI, 2024)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL. - Juha Kontinen; Max Sandström; Jonni Virtema (FoIKS, 2024)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper). - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (ICTCS, 2024)

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (MFCS, 2024)

A First Peek into Preferential Logics with Team Semantics. - Kai Sauerwald; Juha Kontinen (NMR, 2024)

A Primer for Preferential Non-Monotonic Propositional Team Logics. - Kai Sauerwald; Juha Kontinen (CoRR, 2024)

Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). - Juha Kontinen; Jonni Virtema; Heribert Vollmer; Fan Yang 004; Nicolas Fröhlich 001 (Dagstuhl Reports, 2024)

Modular SAT-based techniques for reasoning tasks in team semantics. - Arnaud Durand 001; Juha Kontinen; Jouko Väänänen (J. Comput. Syst. Sci., 2024)

Parameterized complexity of weighted team definability. - Juha Kontinen; Yasir Mahmood 002; Arne Meier; Heribert Vollmer (Math. Struct. Comput. Sci., 2024)

Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (MFCS, 2025)

Set semantics for asynchronous TeamLTL: Expressivity and complexity. - Juha Kontinen; Max Sandström; Jonni Virtema (Inf. Comput., 2025)

Logics with probabilistic team semantics and the Boolean negation. - Miika Hannula; Minna Hirvonen; Juha Kontinen; Yasir Mahmood 002; Arne Meier; Jonni Virtema (J. Log. Comput., 2025)

Logic and Computation Through the Lens of Semirings. - Timon Barlag; Nicolas Fröhlich 001; Teemu Hankala; Miika Hannula; Minna Hirvonen; Vivian Holzapfel; Juha Kontinen; Arne Meier; Laura Strieker (CoRR, 2025)

Independence Under Incomplete Information. - Miika Hannula; Minna Hirvonen; Juha Kontinen; Sebastian Link (CoRR, 2025)

On the Complexity and Properties of Preferential Propositional Dependence Logic. - Kai Sauerwald; Arne Meier; Juha Kontinen (CoRR, 2025)

Local consistency and axioms of functional dependence. - Timon Barlag; Miika Hannula; Juha Kontinen; Nina Pardal; Jonni Virtema (CoRR, 2025)

The flattening operator in team-based logics. - Arnaud Durand 001; Juha Kontinen; Werner Mérian; Jouko Väänänen (CoRR, 2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations. - Melissa Antonelli; Arnaud Durand 001; Juha Kontinen (CoRR, 2025)