| Publication | Date of Publication | Type |
|---|
| Descriptive complexity for distributed computing with circuits | 2024-12-03 | Paper |
| Game characterizations for the number of quantifiers | 2024-10-16 | Paper |
| Dimension in team semantics | 2024-10-16 | Paper |
| The expressive power of CSP-quantifiers | 2024-09-25 | Paper |
| Regular Representations of Uniform TC^0 | 2023-09-13 | Paper |
| A completeness proof for a regular predicate logic with undefined truth value | 2023-05-31 | Paper |
| Dimension in team semantics | 2023-04-06 | Paper |
| Bounded game-theoretic semantics for modal mu-calculus | 2022-12-08 | Paper |
| Defining long words succinctly in FO and MSO | 2022-12-07 | Paper |
| Complexity thresholds in inclusion logic | 2022-06-13 | Paper |
| Defining long words succinctly in FO and MSO | 2022-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021004 | 2022-01-11 | Paper |
| The expressive power of modal logic with inclusion atoms | 2021-12-03 | Paper |
| Independence-friendly logic without Henkin quantification | 2021-07-21 | Paper |
| Model Checking and Validity in Propositional and Modal Inclusion Logics | 2020-05-26 | Paper |
| Complexity thresholds in inclusion logic | 2020-03-04 | Paper |
| Formula size games for modal logic and μ-calculus | 2020-02-17 | Paper |
| Model checking and validity in propositional and modal inclusion logics | 2020-02-03 | Paper |
| The Size of a Formula as a Measure of Complexity | 2020-02-03 | Paper |
| Satisfiability of Modal Inclusion Logic | 2019-11-22 | Paper |
| Implicit definability and infinitary logic in finite model theory | 2019-01-10 | Paper |
| The Succinctness of First-order Logic over Modal Logic via a Formula Size Game | 2018-04-23 | Paper |
| One-dimensional fragment of first-order logic | 2018-04-23 | Paper |
| The Expressive Power of Modal Dependence Logic | 2018-04-23 | Paper |
| Independence-friendly logic without Henkin quantification | 2017-12-20 | Paper |
| Dependence Logic vs. Constraint Satisfaction | 2017-07-19 | Paper |
| Boolean dependence logic and partially-ordered connectives | 2017-06-30 | Paper |
| Bounded game-theoretic semantics for modal mu-calculus | 2017-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958528 | 2017-02-02 | Paper |
| Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary Relations | 2016-08-05 | Paper |
| Existential second-order logic and modal logic with quantified accessibility relations | 2016-03-10 | Paper |
| Modal Inclusion Logic: Being Lax is Simpler than Being Strict | 2015-09-16 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2015-03-25 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2014-12-05 | Paper |
| Boolean Dependence Logic and Partially-Ordered Connectives | 2013-09-17 | Paper |
| Extended Modal Dependence Logic $\mathcal{EMDL}$ | 2013-09-17 | Paper |
| Expressibility of Higher Order Logics | 2013-06-06 | Paper |
| On the existence of a modal-logical basis for monadic second-order logic | 2013-04-19 | Paper |
| Partially ordered connectives and monadic monotone strict NP | 2009-06-17 | Paper |
| Complete Problems for Higher Order Logics | 2009-03-12 | Paper |
| Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic | 2008-03-07 | Paper |
| Logics with aggregate operators | 2008-02-11 | Paper |
| Computing queries with higher-order logics | 2006-04-28 | Paper |
| Approximate pattern matching and transitive closure logics. | 2003-05-25 | Paper |
| Vectorization hierarchies of some graph quantifiers | 2001-03-13 | Paper |
| Notions of locality and their logical characterizations over finite models | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936132 | 2000-01-24 | Paper |
| Enhancing fixed point logic with cardinality quantifiers | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395556 | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395567 | 1998-06-11 | Paper |
| Capturing Relativized Complexity Classes without Order | 1998-03-30 | Paper |
| Definability of polyadic lifts of generalized quantifiers | 1998-01-28 | Paper |
| How to define a linear order on finite models | 1998-01-07 | Paper |
| Almost Everywhere Equivalence of Logics in Finite Model Theory | 1997-09-02 | Paper |
| Logical hierarchies in PTIME | 1997-06-22 | Paper |
| The hierarchy theorem for generalized quantifiers | 1997-06-15 | Paper |
| The expressive power of finitely many generalized quantifiers | 1996-11-04 | Paper |
| A double arity hierarchy theorem for transitive closure logic | 1996-08-22 | Paper |
| Remarks on The Cartesian Closure | 1993-04-01 | Paper |
| The Beth-closure of ℒ(Qα) is not finitely generated | 1993-04-01 | Paper |
| Definability hierarchies of generalized quantifiers | 1989-01-01 | Paper |
