Dual weak pigeonhole principle, Boolean complexity, and derandomization. - Emil Jerábek (Ann. Pure Appl. Log., 2004)

A note on Grzegorczyk's logic. - Emil Jerábek (Math. Log. Q., 2004)

Admissible Rules of Modal Logics. - Emil Jerábek (J. Log. Comput., 2005)

Frege systems for extensible modal logics. - Emil Jerábek (Ann. Pure Appl. Log., 2006)

The strength of sharply bounded induction. - Emil Jerábek (Math. Log. Q., 2006)

Complexity of admissible rules. - Emil Jerábek (Arch. Math. Log., 2007)

Fragment of Nonstandard Analysis with a Finitary Consistency Proof. - Michal Rössler; Emil Jerábek (Bull. Symb. Log., 2007)

Approximate counting in bounded arithmetic. - Emil Jerábek (J. Symb. Log., 2007)

On Independence of Variants of the Weak Pigeonhole Principle. - Emil Jerábek (J. Log. Comput., 2007)

Independent Bases of Admissible Rules. - Emil Jerábek (Log. J. IGPL, 2008)

Substitution Frege and extended Frege proof systems in non-classical logics. - Emil Jerábek (Ann. Pure Appl. Log., 2009)

Approximate counting by hashing in bounded arithmetic. - Emil Jerábek (J. Symb. Log., 2009)

Canonical rules. - Emil Jerábek (J. Symb. Log., 2009)

Proof Complexity of the Cut-free Calculus of Structures. - Emil Jerábek (J. Log. Comput., 2009)

Admissible Rules of Lukasiewicz Logic. - Emil Jerábek (J. Log. Comput., 2010)

Bases of Admissible Rules of Lukasiewicz Logic. - Emil Jerábek (J. Log. Comput., 2010)

Abelian groups and quadratic residues in weak arithmetic. - Emil Jerábek (Math. Log. Q., 2010)

On theories of bounded arithmetic for NC1. - Emil Jerábek (Ann. Pure Appl. Log., 2011)

A sorting network in bounded arithmetic. - Emil Jerábek (Ann. Pure Appl. Log., 2011)

Blending margins - Emil Jerábek (CoRR, 2011)

Simulating non-prenex cuts in quantified propositional calculus. - Emil Jerábek; Phuong Nguyen 001 (Math. Log. Q., 2011)

Proofs with monotone cuts. - Emil Jerábek (Math. Log. Q., 2012)

Sequence encoding without induction. - Emil Jerábek (Math. Log. Q., 2012)

The Ubiquity of conservative Translations. - Emil Jerábek (Rev. Symb. Log., 2012)

Root finding with threshold circuits. - Emil Jerábek (Theor. Comput. Sci., 2012)

Real closures of models of weak arithmetic. - Emil Jerábek; Leszek Aleksander Kolodziejczyk (Arch. Math. Log., 2013)

The complexity of admissible rules of Łukasiewicz logic. - Emil Jerábek (J. Log. Comput., 2013)

Open induction in a bounded arithmetic for TC^0. - Emil Jerábek (CoRR, 2014)

Open induction in a bounded arithmetic for TC0. - Emil Jerábek (Arch. Math. Log., 2015)

Rules with parameters in modal logic I. - Emil Jerábek (Ann. Pure Appl. Log., 2015)

Blending margins: the modal logic K has nullary unification type. - Emil Jerábek (J. Log. Comput., 2015)

Division by zero. - Emil Jerábek (Arch. Math. Log., 2016)

Galois connection for multiple-output operations. - Emil Jerábek (CoRR, 2016)

Integer factoring and modular square roots. - Emil Jerábek (J. Comput. Syst. Sci., 2016)

A note on the substructural hierarchy. - Emil Jerábek (Math. Log. Q., 2016)

Cluster expansion and the boxdot conjecture. - Emil Jerábek (Math. Log. Q., 2016)

Proof complexity of intuitionistic implicational formulas. - Emil Jerábek (Ann. Pure Appl. Log., 2017)

Rigid models of Presburger arithmetic. - Emil Jerábek (Math. Log. Q., 2019)

Induction rules in bounded arithmetic. - Emil Jerábek (Arch. Math. Log., 2020)

Rules with parameters in modal logic II. - Emil Jerábek (Ann. Pure Appl. Log., 2020)

Recursive functions and existentially closed structures. - Emil Jerábek (J. Math. Log., 2020)

On the Complexity of the Clone Membership Problem. - Emil Jerábek (Theory Comput. Syst., 2021)

Iterated multiplication in VTC 0. - Emil Jerábek (Arch. Math. Log., 2022)

Elementary analytic functions in VTC0. - Emil Jerábek (CoRR, 2022)

Models of VTC0 as exponential integer parts. - Emil Jerábek (CoRR, 2022)

The theory of hereditarily bounded sets. - Emil Jerábek (Math. Log. Q., 2022)

On the proof complexity of logics of bounded branching. - Emil Jerábek (Ann. Pure Appl. Log., 2023)

A note on the complexity of addition. - Emil Jerábek (CoRR, 2023)

Models of VTC 0 $ mathsf {VTC^0}$ as exponential integer parts. - Emil Jerábek (Math. Log. Q., 2023)

Elementary analytic functions in VTC0. - Emil Jerábek (Ann. Pure Appl. Log., 2023)

A note on the Theory of Well Orders. - Emil Jerábek (Bull. Symb. Log., 2024)

On the theory of exponential integer parts. - Emil Jerábek (CoRR, 2024)

A Simplified Lower Bound for Implicational Logic. - Emil Jerábek (Bull. Symb. Log., 2025)