| No. |
Title |
Author |
Year |
| 1 |
Complexity of Counting First-Order Logic for the Subword Order |
Kuske, Dietrich et al. |
2020 |
| 2 |
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures |
Abu Zaid, Faried et al. |
2018 |
| 3 |
Gaifman Normal Forms for Counting Extensions of First-Order Logic |
Kuske, Dietrich et al. |
2018 |
| 4 |
Infinite and Bi-infinite Words with Decidable Monadic Theories |
Kuske, Dietrich et al. |
2015 |
| 5 |
Isomorphisms of scattered automatic linear orders |
Kuske, Dietrich |
2012 |
| 6 |
Is Ramsey's Theorem omega-automatic? |
Kuske, Dietrich |
2010 |
| 7 |
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures |
Downey, Rod et al. |
2008 |
| 8 |
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures |
Downey, Rod et al. |
2008 |
| 9 |
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic |
Kuske, Dietrich |
2008 |
| 10 |
Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic |
Kuske, Dietrich |
2008 |
