Welcome to the web page of Emil Jeřábek^*

I am a researcher at the Department of Mathematical Logic, Numerical Algebra and Graph Theory of the Institute of Mathematics of the Academy of Sciences of the Czech Republic, with research interests in mathematical logic, including weak arithmetics and modal logic.

My professional CV. Some stuff not related to my research.

Publications and preprints

• A sorting network in bounded arithmetic, preprint, 2008, 25 pp. [abstract] [PS, PDF] [BIB]
• On theories of bounded arithmetic for NC¹, preprint, 2008, 27 pp. [abstract] [PS, PDF] [BIB]
• Abelian groups and quadratic residues in weak arithmetic, preprint, 2008, 23 pp. [abstract] [PS, PDF] [BIB]
• Canonical rules, Journal of Symbolic Logic, to appear. [abstract] [PS, PDF] [BIB]
• Proof complexity of the cut-free calculus of structures, Journal of Logic and Computation, to appear. [DOI] [abstract] [PS, PDF] [BIB]
• Approximate counting by hashing in bounded arithmetic, Journal of Symbolic Logic, to appear. [abstract] [PS, PDF] [BIB]
• Substitution Frege and extended Frege proof systems in non-classical logics, Annals of Pure and Applied Logic, to appear. [DOI] [abstract] [PS, PDF] [BIB]
• Independent bases of admissible rules, Logic Journal of the IGPL 16 (2008), no. 3, pp. 249–267. [DOI] [abstract] [PS, PDF] [BIB]
• On independence of variants of the weak pigeonhole principle, Journal of Logic and Computation 17 (2007), no. 3, pp. 587–604. [DOI] [abstract] [PS, PDF] [BIB]
• The strength of sharply bounded induction, Mathematical Logic Quarterly 52 (2006), no. 6, pp. 613–624. [DOI] [abstract] [PS, PDF] [BIB]
• Approximate counting in bounded arithmetic, Journal of Symbolic Logic 72 (2007), no. 3, pp. 959–993. [DOI] [abstract] [PS, PDF] [BIB]
• Frege systems for extensible modal logics, Annals of Pure and Applied Logic 142 (2006), pp. 366–379. [DOI] [abstract] [PS, PDF] [BIB]
• Complexity of admissible rules, Archive for Mathematical Logic 46 (2007), no. 2, pp. 73–92. [DOI] [abstract] [PS, PDF] [BIB]
• Admissible rules of modal logics, Journal of Logic and Computation 15 (2005), no. 4, pp. 411–431. [DOI] [abstract] [PS, PDF] [BIB]
• Weak pigeonhole principle, and randomized computation, Ph.D. thesis, Faculty of Mathematics and Physics, Charles University, Prague, 2005, 116 pp. [abstract] [printable PS, browsable PDF] [BIB]
• A note on Grzegorczyk’s logic, Mathematical Logic Quarterly 50 (2004), no. 3, pp. 295–296. [DOI] [abstract] [PS, PDF] [BIB]
• Dual weak pigeonhole principle, Boolean complexity, and derandomization, Annals of Pure and Applied Logic 129 (2004), pp. 1–37. [DOI] [abstract] [PS, PDF] [BIB]
• with Michal Rössler: Fragment of nonstandard analysis with a finitary consistency proof, Bulletin of Symbolic Logic 13 (2007), no. 1, pp. 54–70. [DOI] [abstract] [PDF] [BIB]
• 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. [abstract] [PDF] [BIB]
• 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. [abstract] [PS, PDF] [BIB]
• Provability logic of the Alternative Set Theory, Master’s thesis, Faculty of Philosophy and Arts, Charles University, Prague, 2001, 44 pp. [introduction] [PS, PDF] [BIB]

Slides for talks

• Proof systems for modal logics, Logic Colloquium 2007, Uniwersytet Wrocławski, July 2007. [PDF]
• Canonical rules, Derivation Rules and Unification (International Workshop on Modal Logic IWML06), İstanbul Kültür Üniversitesi, June 2006. [PDF]
• Approximate counting in bounded arithmetic, New Directions in Proof Complexity (Isaac Newton Institute workshop LAAW04), Cambridge, April 2006. [PDF]

Teaching

• Teorie modelů (FF UK, Spring 2008/09)
• Teorie množin (FF UK, Spring 2007/08)