| Publication | Date of Publication | Type |
|---|
Descriptive complexity for distributed computing with circuits
| 2024-12-03 | Paper |
Game characterizations for the number of quantifiers
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
Dimension in team semantics
Mathematical Structures in Computer Science | 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
Notre Dame Journal of Formal Logic | 2023-05-31 | Paper |
Dimension in team semantics
| 2023-04-06 | Paper |
Bounded game-theoretic semantics for modal mu-calculus
Information and Computation | 2022-12-08 | Paper |
Defining long words succinctly in FO and MSO
| 2022-12-07 | Paper |
Complexity thresholds in inclusion logic
Information and Computation | 2022-06-13 | Paper |
Defining long words succinctly in FO and MSO
| 2022-02-21 | Paper |
scientific article; zbMATH DE number 7455742 (Why is no real title available?)
| 2022-01-11 | Paper |
The expressive power of modal logic with inclusion atoms
| 2021-12-03 | Paper |
Independence-friendly logic without Henkin quantification
Archive for Mathematical Logic | 2021-07-21 | Paper |
Model checking and validity in propositional and modal inclusion logics
| 2020-05-26 | Paper |
Complexity thresholds in inclusion logic
Logic, Language, Information, and Computation | 2020-03-04 | Paper |
Formula size games for modal logic and \(\mu\)-calculus
Journal Of Logic And Computation | 2020-02-17 | Paper |
Model checking and validity in propositional and modal inclusion logics
Journal Of Logic And Computation | 2020-02-03 | Paper |
The Size of a Formula as a Measure of Complexity
Logic Without Borders | 2020-02-03 | Paper |
Satisfiability of modal inclusion logic. Lax and strict semantics
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Implicit definability and infinitary logic in finite model theory (extended abstract)
Automata, Languages and Programming | 2019-01-10 | Paper |
The expressive power of modal dependence logic
| 2018-04-23 | 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 |
Independence-friendly logic without Henkin quantification
Logic, Language, Information, and Computation | 2017-12-20 | Paper |
Dependence logic vs. constraint satisfaction
| 2017-07-19 | Paper |
Boolean dependence logic and partially-ordered connectives
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Bounded game-theoretic semantics for modal mu-calculus
| 2017-06-02 | Paper |
scientific article; zbMATH DE number 6680142 (Why is no real title available?)
| 2017-02-02 | Paper |
Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
Electronic Notes in Theoretical Computer Science | 2016-08-05 | Paper |
Existential second-order logic and modal logic with quantified accessibility relations
Information and Computation | 2016-03-10 | Paper |
Modal inclusion logic: being lax is simpler than being strict
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Weak models of distributed computing, with connections to modal logic
Distributed Computing | 2015-03-25 | Paper |
Weak models of distributed computing, with connections to modal logic
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Extended modal dependence logic \(\mathcal{EMDL}\)
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Boolean dependence logic and partially-ordered connectives
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Expressibility of higher order logics
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
On the existence of a modal-logical basis for monadic second-order logic
Journal Of Logic And Computation | 2013-04-19 | Paper |
Partially ordered connectives and monadic monotone strict NP
Journal of Logic, Language and Information | 2009-06-17 | Paper |
Complete Problems for Higher Order Logics
Computer Science Logic | 2009-03-12 | Paper |
Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic
Logic Journal of the IGPL | 2008-03-07 | Paper |
Logics with aggregate operators
Journal of the ACM | 2008-02-11 | Paper |
Computing queries with higher-order logics
Theoretical Computer Science | 2006-04-28 | Paper |
Approximate pattern matching and transitive closure logics.
Theoretical Computer Science | 2003-05-25 | Paper |
Vectorization hierarchies of some graph quantifiers
Archive for Mathematical Logic | 2001-03-13 | Paper |
Notions of locality and their logical characterizations over finite models
Journal of Symbolic Logic | 2000-06-07 | Paper |
scientific article; zbMATH DE number 1392293 (Why is no real title available?)
| 2000-01-24 | Paper |
Enhancing fixed point logic with cardinality quantifiers
Journal Of Logic And Computation | 1998-07-28 | Paper |
scientific article; zbMATH DE number 1163932 (Why is no real title available?)
| 1998-06-11 | Paper |
scientific article; zbMATH DE number 1163943 (Why is no real title available?)
| 1998-06-11 | Paper |
Capturing Relativized Complexity Classes without Order
Mathematical Logic Quarterly | 1998-03-30 | Paper |
Definability of polyadic lifts of generalized quantifiers
Journal of Logic, Language and Information | 1998-01-28 | Paper |
How to define a linear order on finite models
Annals of Pure and Applied Logic | 1998-01-07 | Paper |
Almost Everywhere Equivalence of Logics in Finite Model Theory
The Bulletin of Symbolic Logic | 1997-09-02 | Paper |
Logical hierarchies in PTIME
Information and Computation | 1997-06-22 | Paper |
The hierarchy theorem for generalized quantifiers
Journal of Symbolic Logic | 1997-06-15 | Paper |
The expressive power of finitely many generalized quantifiers
Information and Computation | 1996-11-04 | Paper |
A double arity hierarchy theorem for transitive closure logic
Archive for Mathematical Logic | 1996-08-22 | Paper |
Remarks on The Cartesian Closure
Mathematical Logic Quarterly | 1993-04-01 | Paper |
The Beth-closure of ℒ(Qα) is not finitely generated
Journal of Symbolic Logic | 1993-04-01 | Paper |
Definability hierarchies of generalized quantifiers
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
