TU-Vienna Logo

Institute of
Discrete Mathematics and Geometry - Home

Welcome to the web pages of the computational logic group. Below is a short description of our research. For more information look at the individual descriptions given by the people in our group.

Research topics

  • Proof theory
  • Proof complexity
  • General logics
  • Computability theory
  • Automata theory
  • Juridical logic

Computational logic is the discipline of mathematics and computer science that is concerned with the algorithmic variants of logical theorems. Its basis are the classical results of proof theory and recursion theory and its fine structure is dominated by automata theory. Proof theory and proof complexity study the transformations of formal derivations and their limits. They are applicable to automated theorem proving by comparing human and machine made proofs, and to general logics (classical and nonclassical) by determining adequate calculi. Juridical logic can be considered as part of computational logic because the main feature of formal juridical procedures is the analysis of arguments that are already provided.