Curriculum Vitae

NameEmil Jeřábek
Date of birthJune 27, 1977
Place of birthPrague, Czechoslovakia
Gendermale
AddressInstitute of Mathematics, AS CR
Žitná 25
115 67  Praha 1
Czech Republic

+420 222 090 772
jerabek@math.cas.skip-this-part.cz
http://math.cas.cz/~jerabek

Education

1995–2001undergraduate studies of Mathematics at the Faculty of Mathematics and Physics of the Charles University, Prague
Master’s degree (Mgr) obtained May 2001
1995–2002undergraduate studies of Logic and Linguistics at the Faculty of Philosophy and Arts of the Charles University, Prague
Master’s degree (Mgr) obtained February 2002
2001–2005postgraduate studies at the Faculty of Mathematics and Physics of the Charles University, Prague
Supervisor: Jan Krajíček, Mathematical Institute of the Academy of Sciences of the Czech Republic, Prague
Ph.D. degree obtained June 2005

Employment

1999–2009part-time position at the Faculty of Mathematics and Physics of the Charles University
2003–2005part-time graduate student position at the Mathematical Institute of the Academy of Sciences of the Czech Republic
Mar–Aug 2005postdoc position at the Department of Philosophy of the University of Utrecht
Oct 2005–Oct 2006postdoc position at the Department of Computer Science of the University of Toronto
since Oct 2006full-time position at the Mathematical Institute of AS CR

Awards

2010Otto Wichterle Award

Publications

  1. Reflexe v neregulárních univerzech (Elementary embeddings in non-wellfounded set theory), Master’s thesis, Faculty of Mathematics and Physics, Charles University, Prague, 2001, 41 pp., in Czech.
  2. Provability logic of the Alternative Set Theory, Master’s thesis, Faculty of Philosophy and Arts, Charles University, Prague, 2001, 44 pp.
  3. A note on Grzegorczyk’s logic, Mathematical Logic Quarterly 50 (2004), no. 3, pp. 295–296.
  4. Dual weak pigeonhole principle, Boolean complexity, and derandomization, Annals of Pure and Applied Logic 129 (2004), pp. 1–37.
  5. Weak pigeonhole principle, and randomized computation, Ph.D. thesis, Faculty of Mathematics and Physics, Charles University, Prague, 2005, 116 pp.
  6. Admissible rules of modal logics, Journal of Logic and Computation 15 (2005), no. 4, pp. 411–431.
  7. with Tomáš Kepka and David Stanovský: Subdirectly irreducible non-idempotent left symmetric left distributive groupoids, Discussiones Mathematicae – General Algebra and Applications 25 (2005), no. 2, pp. 235–257.
  8. Frege systems for extensible modal logics, Annals of Pure and Applied Logic 142 (2006), pp. 366–379.
  9. The strength of sharply bounded induction, Mathematical Logic Quarterly 52 (2006), no. 6, pp. 613–624.
  10. Complexity of admissible rules, Archive for Mathematical Logic 46 (2007), no. 2, pp. 73–92.
  11. On independence of variants of the weak pigeonhole principle, Journal of Logic and Computation 17 (2007), no. 3, pp. 587–604.
  12. with Michal Rössler: Fragment of nonstandard analysis with a finitary consistency proof, Bulletin of Symbolic Logic 13 (2007), no. 1, pp. 54–70.
  13. Approximate counting in bounded arithmetic, Journal of Symbolic Logic 72 (2007), no. 3, pp. 959–993.
  14. Independent bases of admissible rules, Logic Journal of the IGPL 16 (2008), no. 3, pp. 249–267.
  15. Proof complexity of the cut-free calculus of structures, Journal of Logic and Computation 19 (2009), no. 2, pp. 323–339.
  16. Substitution Frege and extended Frege proof systems in non-classical logics, Annals of Pure and Applied Logic 159 (2009), no. 1–2, pp. 1–48.
  17. Approximate counting by hashing in bounded arithmetic, Journal of Symbolic Logic 74 (2009), no. 3, pp. 829–860.
  18. Canonical rules, Journal of Symbolic Logic 74 (2009), no. 4, pp. 1171–1205.
  19. Abelian groups and quadratic residues in weak arithmetic, Mathematical Logic Quarterly 56 (2010), no. 3, pp. 262–278.
  20. Admissible rules of Łukasiewicz logic, Journal of Logic and Computation 20 (2010), no. 2, pp. 425–447.
  21. Bases of admissible rules of Łukasiewicz logic, Journal of Logic and Computation 20 (2010), no. 6, pp. 1149–1163.
  22. On theories of bounded arithmetic for NC1, Annals of Pure and Applied Logic 162 (2011), no. 4, pp. 322–340.
  23. A sorting network in bounded arithmetic, Annals of Pure and Applied Logic 162 (2011), no. 4, pp. 341–355.
  24. with Phuong Nguyen: Simulating non-prenex cuts in quantified propositional calculus, Mathematical Logic Quarterly 57 (2011), no. 5, pp. 524–532.
  25. Proofs with monotone cuts, Mathematical Logic Quarterly 58 (2012), no. 3, pp. 177–187.
  26. Sequence encoding without induction, Mathematical Logic Quarterly 58 (2012), no. 3, pp. 244–248.
  27. Root finding with threshold circuits, Theoretical Computer Science 462 (2012), pp. 59–69.
  28. The ubiquity of conservative translations, Review of Symbolic Logic 5 (2012), no. 4, pp. 666–678.
  29. with Leszek Kołodziejczyk: Real closures of models of weak arithmetic, Archive for Mathematical Logic 52 (2013), no. 1–2, pp. 143–157.
  30. The complexity of admissible rules of Łukasiewicz logic, Journal of Logic and Computation 23 (2013), no. 3, pp. 693–705.

Conference talks

  1. A note on Grzegorczyk’s logic, Logic Colloquium (LC2003), Helsinki, August 2003.
  2. Bounded arithmetic in 3-valued logic, Logic Colloquium (LC2004), Torino, July 2004.
  3. Hardness amplification in bounded arithmetic, 24èmes Journées d’Arithmétique Faible (JAF24), Fontainebleau, May 2005.
  4. Approximate counting in bounded arithmetic, New Directions in Proof Complexity, Cambridge, April 2006.
  5. Canonical rules, Derivation Rules and Unification (International Workshop on Modal Logic IWML06), İstanbul Kültür Üniversitesi, June 2006.
  6. Proof systems for modal logics, Logic Colloquium (LC2007), Wrocław, July 2007.
  7. Admissible rules of Łukasiewicz logic, Logic Colloquium (LC2009), Sofia, July 2009.
  8. On monotone sequent calculus, Barriers in Computational Complexity, Princeton, August 2009.
  9. Weak pigeonhole principle and approximate counting, Ramsey Theory in Logic, Combinatorics and Complexity (RaTLoCC 2009), Bertinoro, October 2009.
  10. Approximate counting in bounded arithmetic, 29es Journées sur les Arithmétiques Faibles (JAF29), Warsaw, June 2010.
  11. Proofs with monotone cuts, Logic Colloquium (LC2010), Paris, July 2010.
  12. Admissible rules and Łukasiewicz logic, Algebraic Semantics for Uncertainty and Vagueness, Salerno, May 2011.
  13. Admissible rules of Łukasiewicz logic, Workshop on Admissible Rules and Unification, Utrecht, May 2011.
  14. Root finding in TC0, Proof complexity, Banff, October 2011.
  15. Root finding in TC0 and open induction, Logical Approaches to Barriers in Complexity II, Cambridge, March 2012.
  16. Rules with parameters in modal logic, The 26th International Workshop on Unification (UNIF 2012), Manchester, July 2012.
  17. Admissibility and unification with parameters, Logic, Algebra and Truth Degrees (LATD 2012), Kanazawa, September 2012.
  18. Logics with directed unification, Algebra and Coalgebra meet Proof Theory (ALCOP), Utrecht, April 2013.
  19. Open induction in a TC0 arithmetic, Logic Colloquium, Évora, July 2013.

Other activities

I am a reviewer for the Zentralblatt MATH Database.

Back to the main page