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

I am a researcher at the Department of Mathematical Logic, Algebra and Theoretical Computer Science 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.

You can find me on the 2nd floor in the rear building of the Institute, office no. 522.

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

Publications and preprints

• Sequence encoding without induction, preprint, 2012, 7 pp. [abstract] [PS, PDF] [BIB]
• Root finding with threshold circuits, preprint, 2011, 19 pp. [abstract] [PS, PDF] [BIB]
• The complexity of admissible rules of Łukasiewicz logic, preprint, 2011, 14 pp. [abstract] [PS, PDF] [BIB]
• Blending margins, preprint, 2011, 9 pp. [abstract] [PS, PDF] [BIB]
• The ubiquity of conservative translations, preprint, 2011, 14 pp. [abstract] [PS, PDF] [BIB]
• with Leszek Kołodziejczyk: Real closures of models of weak arithmetic, preprint, 2011, 19 pp. [abstract] [PS, PDF] [BIB]
• with Phuong Nguyen: Simulating non-prenex cuts in quantified propositional calculus, Mathematical Logic Quarterly 57 (2011), no. 5, pp. 524–532. [DOI] [abstract] [PS, PDF] [BIB]
• Proofs with monotone cuts, preprint, 2010, 14 pp. [abstract] [PS, PDF] [BIB]
• Bases of admissible rules of Łukasiewicz logic, Journal of Logic and Computation 20 (2010), no. 6, pp. 1149–1163. [DOI] [abstract] [PS, PDF] [BIB]
• Admissible rules of Łukasiewicz logic, Journal of Logic and Computation 20 (2010), no. 2, pp. 425–447. [DOI] [abstract] [PS, PDF] [BIB]
• A sorting network in bounded arithmetic, Annals of Pure and Applied Logic 162 (2011), no. 4, pp. 341–355. [DOI] [abstract] [PS, PDF] [BIB]
• On theories of bounded arithmetic for NC¹, Annals of Pure and Applied Logic 162 (2011), no. 4, pp. 322–340. [DOI] [abstract] [PS, PDF] [BIB]
• Abelian groups and quadratic residues in weak arithmetic, Mathematical Logic Quarterly 56 (2010), no. 3, pp. 262–278. [DOI] [abstract] [PS, PDF] [BIB]
• Canonical rules, Journal of Symbolic Logic 74 (2009), no. 4, pp. 1171–1205. [DOI] [abstract] [PS, PDF] [BIB]
• Proof complexity of the cut-free calculus of structures, Journal of Logic and Computation 19 (2009), no. 2, pp. 323–339. [DOI] [abstract] [PS, PDF] [BIB]
• Approximate counting by hashing in bounded arithmetic, Journal of Symbolic Logic 74 (2009), no. 3, pp. 829–860. [DOI] [abstract] [PS, PDF] [BIB]
• 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. [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

• Admissible rules and Łukasiewicz logic. This is a common unifier (not quite the mgu) of related talks presented at Algebraic Semantics for Uncertainty and Vagueness (Salerno, May 2011), Workshop on Admissible Rules and Unification (Utrecht, May 2011), and, in part, Logic Colloquium (Sofia, July 2009). [PS, PDF]
• Proofs with monotone cuts, Logic Colloquium, Paris, July 2010. [PS, PDF]
• Approximate counting in bounded arithmetic, 29es Journées sur les Arithmétiques Faibles, Warsaw, June 2010. [PS, PDF]
• On monotone sequent calculus, Barriers in Computational Complexity workshop, Princeton, August 2009. [PS, PDF]
• Proof systems for modal logics, Logic Colloquium, Wrocław, July 2007. [PS, PDF]
• Canonical rules, Derivation Rules and Unification (International Workshop on Modal Logic IWML06), İstanbul Kültür Üniversitesi, June 2006. [PS, PDF]
• Approximate counting in bounded arithmetic, New Directions in Proof Complexity (Isaac Newton Institute workshop LAAW04), Cambridge, April 2006. [PS, PDF]

Teaching

• Teorie modelů (FF UK, Fall 2010/11)