Publications

Martin Otto

2002

  • E. Grädel, C. Hirsch, and M. Otto. Back and Forth Between Guarded and Modal Logics. ACM Transactions on Computational Logics, vol. 3(3), pp. 418 – 463, 2002.                                 

2000

  • E. Grädel, C. Hirsch, and M. Otto. Back and Forth Between Guarded and Modal Logics. In Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000, pp. 217–228, Santa Barbara, 2000.                                 

1999

  • E. Grädel and M. Otto. On Logics with Two Variables. Theoretical Computer Science, vol. 224, pp. 73–113, 1999.                                 
  • E. Grädel, M. Otto, and E. Rosen. Undecidability Results on Two-Variable Logics. Archive for Mathematical Logic, vol. 38, pp. 213–354, 1999.                                 
  • E. Hoogland, M. Marx, and M. Otto. Beth Definability for the Guarded Fragment. In Proceedings of LPAR'99, LNAI. Springer, 1999.                                 
  • F. Neven, M. Otto, J. Tyszkiewicz, and V. den Bussche. Adding FOR-Loops to First-Order Logic. In Proceedings of ICDT'99, vol. 1540 of LNCS, pp. 58–69. Springer, 1999.             
  • M. Otto. Bounded-Variable Logics: Two, Three, and More. Archive for Mathematical Logic, vol. 38, pp. 235–256, 1999.                                 
  • M. Otto. Bisimulation-Invariant Ptime and Higher-Dimensional mu-Calculus. Theoretical Computer Science, vol. 224, pp. 237–265, 1999.                                 
  • M. Otto. Eliminating Recursion in the $\mu$-Calculus. In Proceedings of STACS'99, vol. 1563 of LNCS, pp. 531–540. Springer, 1999.                                 

1998

  • P. Kolaitis and M. Otto. {On the Boundedness Problem for Two-Variable First-Order Logic}. In Proceedings of IEEE Symposium on Logic in Computer Science LICS `98, 1998.                                 
  • M. Otto. Two-Variable First-Order Logic over Ordered Domains. 1998.                                 
  • M. Otto. Epsilon-Logic is More Expressive Than First-Order Logic over Finite Structures. 1998.                                 
  • M. Otto. An interpolation theorem. 1998.                                 

1997

  • E. Grädel, M. Otto, and E. Rosen. Two-Variable Logic with Counting is Decidable. In Proceedings of 12th IEEE Symposium on Logic in Computer Science LICS `97, Warschau, 1997.                                 
  • E. Grädel, M. Otto, and E. Rosen. Undecidability Results on Two-Variable Logics. In Proceedings of 14th Symposium on Theoretical Aspects of Computer Science STACS`97, vol. 1200 of Lecture Notes in Computer Science, pp. 249–260, 1997.             
  • M. Otto. {Canonization for Two Variables and Puzzles on the Square}. Annals of Pure and Applied Logic, vol. 85, pp. 243–282, 1997.                                 
  • M. Otto. Capturing Bisimulation-Invariant Ptime. In Proceedings of 4th Symposium on Logical Foundations of Computer Science, LFCS `97, vol. 1234 of LNCS, pp. 294–305. Springer, 1997.             
  • M. Otto. Bounded variable logics and counting — A study in finite models. Springer, 1997.                                 
  • M. Otto. The Logic of Explicitly Representation-Invariant Circuits. Selected Papers of CSL `96, vol. 1258, pp. 369–384, 1997.             

1996

  • M. Otto. The {Expressive Power of Fixed-Point Logic with Counting}. Journal of Symbolic Logic, vol. 61, pp. 147–176, 1996.                                 
  • M. Otto and J. V. den Bussche. First-{Order Queries on Databases Embedded in an Infinite Structure}. Information Processing Letters, vol. 60, pp. 37–41, 1996.             

1995

  • M. Otto. Bounded variable logics and counting — A study in finite models. 1995.             
  • M. Otto. A note on the number of monadic quantifiers in monadic {$\Sigma^1\_1$}. Information Processing Letters, vol. 53(6), pp. 337–339, 1995.                                 
  • M. Otto. Ptime canonization for two variables with counting. In Proceedings of 10th IEEE Symposium on Logic in Computer Science LICS `95, pp. 342–352, 1995.                                 

1994

  • M. Otto. Generalized quantifiers for simple properties. In Proceedings of 9th IEEE Symposium on Logic in Computer Science LICS `94, pp. 30–39, 1994.                                 
  • M. Otto. Symmetry and First-Order: Explicitly Representation-Invariant Circuits. 1994.                                 

1993

  • E. Grädel and M. Otto. Inductive Definability with Counting on Finite Structures. In Computer Science Logic, 6th Workshop, CSL `92, San Miniato 1992, Selected Papers (E. Börger, G. Jäger, H. K. Büning, S. Martini, and M. M. Richter, Eds.), vol. 702 of LNCS, pp. 231–247. Springer, 1993.                                 

1992

  • M. Otto. Automorphism Properties of Stationary Logic. Journal of Symbolic Logic, vol. 57, pp. 231–237, 1992.             
  • M. Otto. EM Functors for a Class of Generalized Quantifiers. Archive for Mathematical Logic, vol. 31, pp. 355–371, 1992.             

1990

  • M. Otto. Ehrenfeucht-Mostowski Konstruktionen in Erweiterungslogiken. PhD thesis, Freiburg University, 1990.             

1987

  • M. Otto. A Reduction Scheme for Phase Spaces with Almost-K{ähler Symmetry – Regularity Results for Momentum Level Sets}. Journal of Geometry and Physics, vol. 4, pp. 101–118, 1987.