•  

    • Conferences and Lectures

       
      Select  
       
      Year: Investigators  
       

      Recent 5 :   

      Jeřábek Emil
      Bounded induction without parameters
      FEALORA Farewell Workshop Špindlerův Mlýn (November 2018)

      Jeřábek Emil
      Parameter-free bounded induction
      Proof Complexity Dagstuhl (February 2018)

      Jeřábek Emil
      Galois connection for multiple-output operations
      Arbeitstagung Allgemeine Algebra (AAA96) Darmstadt (June 2018)

      Jeřábek Emil
      Counting in weak theories
      Logic Colloquium Stockholm (August 2017)

      Thapen Neil Dillip
      Random resolution
      Proof complexity and beyond MF Oberwolfach (August 2017)

  •