The research group primarily represents the subject area of Mathematical Logic viewed as an applied foundational discipline between mathematics and computer science. Research activities focus on the application of proof theoretic, recursion theoretic, category theoretic, algebraic and model theoretic methods from mathematical logic to mathematics and computer science.

Beside classical mathematical logic (with proof theory, recursion theory and model theory) this involves constructive type theory, categorical logic, universal algebra, domain theory, lattice theory, finite model theory, and algorithmic issues.

Within mathematics, a primary field of applications in the proof- and recursion-theoretic setting (Kohlenbach) is the extraction of new information from proofs in algebra, analysis, functional analysis, hyperbolic geometry and numerical mathematics (proof mining). This involves qualitative aspects (e.g., independence of existence assertions from certain parameters) as well as quantitative aspects of computability and complexity of solutions (extraction of algorithms and bounds from proofs, exact real arithmetic, “computational mathematics”: Kohlenbach, Streicher). Model theoretic investigations (Herrmann, Otto) make intra-mathematical links with algebra and discrete mathematics.

Concerning Logic in Computer Science and the mathematical foundations of computer science, major activities revolve around issues of semantics. On the one hand this involves the mathematical foundation of the semantics and the logic of programming languages (Keimel†, Streicher); on the other hand, logics and formal systems are investigated in the sense of model theoretic semantics, w.r.t. expressiveness and definability, with an emphasis on computational aspects (algorithmic model theory, finite model theory: Otto). We investigate complexity issues from the point of view of functional programs (implicit computational complexity: Kohlenbach), in the descriptive and the resource-oriented and structural sense (Otto). Besides specific application domains in computer science, as, e.g., verification, data bases and knowledge representation, there is work on foundational issues in the areas of computability and complexity, as well as type theory and category theory.

Overall, the unit forms an internationally well connected cluster of expertise, with a characteristic emphasis on the connections that mathematical logic has to offer, both w.r.t. other areas within mathematics and w.r.t. the Logic in Computer Science spectrum.

Research group on Formal Concept Analysis. Based on lattice and order theoretic foundations, this group in the former AG1 (General Algebra and Discrete Mathematics) focuses on graphical logic systems for concept analysis in knowledge acquisition and processing applications (Burmeister). This research continues to be pursued in close co-operation with the Ernst-Schröder-Zentrum für Begriffliche Wissensverarbeitung.

Current Projects and Cooperations

  • Proof Mining in der konvexen Optimierung und verwandten Gebieten (DFG)

Former National and International Cooperations and Projects

  • Konstruktionen und Modelltheorie für Hypergraphen kontrollierter Azyklizität (DFG,04/2013-03/2018, Otto)
  • Logische Extraktion von effektiven uniformen Schranken aus Beweisen, die auf Folgenkompaktheit basieren (DFG, 09/2012-03/2018, Kohlenbach)
  • Mathematische Modelle für eine Semantik von nichtdeterministischen und probalistischen Phänomenen in der Programmierung (DFG, 07/2011-08/2016, Keimel†)
  • Quantitative uniforme Komplexitätstheorie mehrwertiger reeller Funktionen und Operatoren in Analysis (DFG, 04/2013-01/2016, Ziegler, Streicher)
  • Computable Analysis – COMPUTAL (EU IRSES, 12/2012-12/2015, Ziegler, Streicher)
  • Ausdrucksstärke monadischer Logik zweiter Stufe, ihrer Fragmente und Varianten (DFG, 04/2012-12/2014, Blumensath)
  • Extraction of effective bounds from proofs based on sequential compactness vial logical analysis (DFG, 02/2009-02/2013, Kohlenbach)
  • Strukturkonstruktionen und modelltheoretische Spiele in speziellen Strukturklassen (DFG, 06/2007-03/2011, Otto)
  • Fragments of Dependence Logic with Applications to Real Multifunctions; cooperation with the University of Cambridge (International Exchanges Scheme – 2011/R2 inc. RIA, The Royal Society, Dawar, Otto)
  • Algorithmic Model Theory for Specific Domains (EPSRC, Otto)