It is necessary to activate JavaScript to navigate this site.

 EN

  Intranet   |  Webmail  

Mathematical Logic, Algebra and Theoretical Computer Science (MLATCS)

from 1970

Head: Pudlák Pavel  RNDr., DrSc.

Mathematical logic, theoretical computer science and set theory, proof complexity, proof theory, forcing, computational complexity, finite and infinite combinatorics, matrix theory, scheduling and automatic control.

 Research themes
  • automatic control
  • automatic control
  • forcing in set theory
  • forcing in set theory
  • mathematical logic and complexity theory
  • proof complexity
    computational complexity
    combinatorics
    on-line scheduling
 Members  
   Bulánek  Jan   Ph.D. student
   Chodounský  David   Postdoc
   Ebenlendr  Tomáš   Ph.D. student
   Fiedler  Miroslav   Researcher
   Horská  Anna   Ph.D. student
   Jeřábek  Emil   Researcher
   Koucký  Michal   Researcher
   Krajíček  Jan   Researcher
   Le  Hong Van   Researcher
   Polach  František   Ph.D. student
   Pudlák  Pavel   Researcher
   Sgall  Jiří   Researcher
   Thapen  Neil Dillip   Researcher
   Zajíček  Ondřej   Ph.D. student
   Zapletal  Jindřich   Researcher

 

 Former members      help

Display colors for members and former members of departments (actual status):
  Active member of IM   
  Archived former member of IM   
  Active Joining IM   
  Archived Joining IM