Shortcuts: | Selected Papers | List of Publications | |||||||||||
Selected Talks | Curriculum Vitae | ||||||||||||
Research: AMT | Teaching | the end |
Professor in MathematicsLogic and Mathematical Foundations of Computer ScienceLogic GroupMathematics Department (FB 4)Technische Universität Darmstadt Schlossgartenstrasse 7 D-64289 Darmstadt Germany |
tel: (+49) 06151-1622861 (office) tel: (+49) 06151-1622863 (secretary's office) fax: (+49) 06151-1622840 mail: otto [at] mathematik.tu-darmstadt.de |
Amalgamation and symmetry: from local to global consistency in the finite.
arXiv:1709.00031,
47 pages, 2017;
substantial re-organization of results from
arXiv:1404.4599.
The freedoms of (guarded) bisimulation, with Erich Grädel.
In: Johan van Benthem on Logic and Information Dynamics,
A. Baltag, S. Smets (eds), Springer 2014, pp. 3-31.
Common knowledge & multi-scale locality analysis in Cayley structures, with Felix Canavoi.
Conference paper in LICS 2017.
Pebble games and linear equations, with Martin Grohe.
Journal of Symbolic Logic, volume 80(3), 2015, pp. 797-844;
also see
arXiv:1204.1990;
Decidability results for the boundedness problem,
with A. Blumensath and M. Weyer.
Journal version based on results in the
ICALP'09 paper,
Logical Methods in Computer Science, 10 (3), 2014;
also see
arXiv:1406.7684,
Abstract
Finite conformal hypergraph covers and
Gaifman cliques in finite structures,
with Ian Hodkinson.
Bulletin of Symbolic Logic, volume 9, 2003, pp. 387-405.
Abstract
An Interpolation Theorem,
Bulletin of Symbolic Logic, volume 6, 2000, pp. 447-462.
Abstract
Elementary proof of the van Benthem - Rosen characterisation theorem,
technical report,
TUD online preprint no.2342, 2004, 11 pages.
Abstract
Symmetry and First-Order: Explicitly Presentation-Invariant Circuits.
Unpublished extended version of CSL 96 paper, 1994, 32 pages.
Abstract
Cayley structures as generic epistemic models
Logical Structures in Computation, Simons Institute reunion workshop, Berkeley 2017.
Back & forth between malleable finite models
Berkeley Logic Colloquium,
Berkeley 2016.
(extended material on slides to go with a blackboard talk)
Symmetry-preserving finite synthesis and amalgamation
Workshop on Symmetry, Logic, Computation, Simons Institute,
Berkeley 2016.
Logics for bisimulation invariance
Logical Structures Seminar, Simons Institute,
Berkeley 2016.
Amalgamation and symmetries in the finite
Workshop on Model Theory of Finite and Pseudofinite Structures,
Leeds 2016.
Amalgamation and local-to-global in the finite with suitable groupoids
New Pathways between Group Theory and Model Theory,
Mülheim 2016.
Up to bisimulation -- but keep it finite!, Amsterdam 2015.
Local to Global: Amalgamation and Symmetries in Finite Structures
Leeds Logic Seminar &
Algebra, Logic and Algorithms Seminar, Leeds 2015.
(slides to go with a talk delivered in condensed blackboard version)
Finite Global Realisations of Local Overlap Specifications
Special Session on Computational Logic,
DMV-PTM meeting,
Poznan 2014.
Bisimulation and Coverings for Graphs and Hypergraphs
5th Indian Conference on Logic and Its Applications, ICLA 2013,
Chennai 2013.
Tractable Finite Models
Logic Colloquium, Barcelona 2011.
photograph at the top by L. Otto (2013)
photograph below by H. Otto (2009)