Inductive Definability with Counting on Finite Structures. - Erich Grädel; Martin Otto 001 (CSL, 1992)

EM constructions for a class of generalized quantifiers. - Martin Otto 001 (Arch. Math. Log., 1992)

Automorphism Properties of Stationary Logic. - Martin Otto 001 (J. Symb. Log., 1992)

Generalized Quantifiers for Simple Properties - Martin Otto 001 (LICS, 1994)

Ptime Canonization for Two Variables with Counting - Martin Otto 001 (LICS, 1995)

An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1. - Martin Otto 001 (Inf. Process. Lett., 1995)

The Logic of Explicitly Presentation-Invariant Circuits. - Martin Otto 001 (CSL, 1996)

First-Order Queries on Databases Embedded in an Infinite Structure. - Martin Otto 001; Jan Van den Bussche (Inf. Process. Lett., 1996)

The Expressive Power of Fixed-Point Logic with Counting. - Martin Otto 001 (J. Symb. Log., 1996)

Bounded variable logics and counting - a study in finite models. - Martin Otto 001 (Springer, 1997)

Capturing Bisimulation-Invariant Ptime. - Martin Otto 001 (LFCS, 1997)

Two-Variable Logic with Counting is Decidable. - Erich Grädel; Martin Otto 001; Eric Rosen (LICS, 1997)

Canonization for Two Variables and Puzzles on the Square. - Martin Otto 001 (Ann. Pure Appl. Log., 1997)

On the Boundedness Problem for Two-Variable First-Order Logic. - Phokion G. Kolaitis; Martin Otto 001 (LICS, 1998)

Beth Definability for the Guarded Fragment. - Eva Hoogland; Maarten Marx; Martin Otto 001 (LPAR, 1999)

Eliminating Recursion in the µ-Calculus. - Martin Otto 001 (STACS, 1999)

Undecidability results on two-variable logics. - Erich Grädel; Martin Otto 001; Eric Rosen (Arch. Math. Log., 1999)

Bounded variable logics: two, three, and more. - Martin Otto 001 (Arch. Math. Log., 1999)

On Logics with Two Variables. - Erich Grädel; Martin Otto 001 (Theor. Comput. Sci., 1999)

Bisimulation-invariant PTIME and higher-dimensional µ-calculus. - Martin Otto 001 (Theor. Comput. Sci., 1999)

An interpolation theorem. - Martin Otto 001 (Bull. Symb. Log., 2000)

Epsilon-Logic Is More Expressive Than First-Order Logic Over Finite Structures. - Martin Otto 001 (J. Symb. Log., 2000)

Adding For-Loops to First-Order Logic. - Frank Neven; Martin Otto 001; Jerzy Tyszkiewicz; Jan Van den Bussche (Inf. Comput., 2001)

Two Variable First-Order Logic over Ordered Domains. - Martin Otto 001 (J. Symb. Log., 2001)

Back and forth between guarded and modal logics. - Erich Grädel; Colin Hirsch; Martin Otto 001 (ACM Trans. Comput. Log., 2002)

Finite conformal hypergraph covers and Gaifman cliques in finite structures. - Ian M. Hodkinson; Martin Otto 001 (Bull. Symb. Log., 2003)

Modal and guarded characterisation theorems over finite transition systems. - Martin Otto 001 (Ann. Pure Appl. Log., 2004)

The Boundedness Problem for Monadic Universal First-Order Logic. - Martin Otto 001 (LICS, 2006)

Model theory of modal logic. - Valentin Goranko; Martin Otto 001 (Handbook of Modal Logic, 2007)

Boundedness of Monadic FO over Acyclic Structures. - Stephan Kreutzer; Martin Otto 001; Nicole Schweikardt (ICALP, 2007)

A Lindström characterisation of the guarded fragment and of modal logic with a global modality. - Martin Otto 001; Robert Piro (Advances in Modal Logic, 2008)

Boundedness of Monadic Second-Order Formulae over Finite Words. - Achim Blumensath; Martin Otto 001; Mark Weyer (ICALP (2), 2009)

Modal characterisation theorems over special classes of frames. - Anuj Dawar; Martin Otto 001 (Ann. Pure Appl. Log., 2009)

Model theoretic methods for fragments of FO and special classes of (finite) structures. - Martin Otto 001 (Finite and Algorithmic Model Theory, 2011)

The Freedoms of Guarded Bisimulation. - Martin Otto 001 (CSL, 2011)

Queries with Guarded Negation (full version) - Vince Bárány; Balder ten Cate; Martin Otto 001 (CoRR, 2012)

Highly acyclic groups, hypergraph covers, and the guarded fragment. - Martin Otto 001 (J. ACM, 2012)

Small substructures and decidability issues for first-order logic with two variables. - Emanuel Kieronski; Martin Otto 001 (J. Symb. Log., 2012)

Queries with Guarded Negation. - Vince Bárány; Balder ten Cate; Martin Otto 001 (Proc. VLDB Endow., 2012)

Bisimulation and Coverings for Graphs and Hypergraphs. - Martin Otto 001 (ICLA, 2013)

Groupoids, Hypergraphs, and Symmetries in Finite Models. - Martin Otto 001 (LICS, 2013)

Expressive completeness through logically tractable models. - Martin Otto 001 (Ann. Pure Appl. Log., 2013)

The Freedoms of (Guarded) Bisimulation. - Erich Grädel; Martin Otto 001 (Johan van Benthem on Logic and Information Dynamics, 2014)

Querying the Guarded Fragment. - Vince Bárány; Georg Gottlob; Martin Otto 001 (Log. Methods Comput. Sci., 2014)

Decidability Results for the Boundedness Problem. - Achim Blumensath; Martin Otto 001; Mark Weyer (Log. Methods Comput. Sci., 2014)

Pebble Games and linear equations. - Martin Grohe; Martin Otto 001 (J. Symb. Log., 2015)

Bounded Variable Logics and Counting: A Study in Finite Models - Martin Otto 001 (Cambridge University Press, 2017)

Common knowledge and multi-scale locality analysis in Cayley structures. - Felix Canavoi; Martin Otto 001 (LICS, 2017)

Bisimulation in Inquisitive Modal Logic. - Ivano Ciardelli; Martin Otto 001 (TARK, 2017)

Additive First-Order Queries. - Gerald Berger; Martin Otto 001; Andreas Pieris; Dimitri Surinx; Jan Van den Bussche (ICDT, 2019)

Cayley structures and common knowledge. - Felix Canavoi; Martin Otto 001 (CoRR, 2019)

Graded modal logic and counting bisimulation. - Martin Otto 001 (CoRR, 2019)

Guarded Teams: The Horizontally Guarded Case. - Erich Grädel; Martin Otto 001 (CSL, 2020)

Inquisitive Bisimulation. - Ivano Ciardelli; Martin Otto 001 (J. Symb. Log., 2021)

A First-order Framework for Inquisitive Modal Logic. - Silke Meissner; Martin Otto 001 (Rev. Symb. Log., 2022)

On the expressive power of inquisitive epistemic logic. - Ivano Ciardelli; Martin Otto 001 (CoRR, 2023)