Emil Jerábek

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 36

Top Topics

Decision Procedures

Presburger Arithmetic

Top Venues

Ann. Pure Appl. Log.

Arch. Math. Log.

Publications

Emil Jerábek
On the theory of exponential integer parts. CoRR (2024)
Emil Jerábek
A note on the theory of well orders. CoRR (2024)
Emil Jerábek
Models of VTC 0 $\mathsf {VTC^0}$ as exponential integer parts. Math. Log. Q. 69 (2) (2023)
Emil Jerábek
On the proof complexity of logics of bounded branching. Ann. Pure Appl. Log. 174 (1) (2023)
Emil Jerábek
Elementary analytic functions in VTC0. Ann. Pure Appl. Log. 174 (6) (2023)
Emil Jerábek
A note on the complexity of addition. CoRR (2023)
Emil Jerábek
A simplified lower bound for implicational logic. CoRR (2023)
Emil Jerábek
. CoRR (2022)
Emil Jerábek
. Arch. Math. Log. 61 (5-6) (2022)
Emil Jerábek
as exponential integer parts. CoRR (2022)
Emil Jerábek
The theory of hereditarily bounded sets. Math. Log. Q. 68 (2) (2022)
Emil Jerábek
The theory of hereditarily bounded sets. CoRR (2021)
Emil Jerábek
On the Complexity of the Clone Membership Problem. Theory Comput. Syst. 65 (5) (2021)
Emil Jerábek
Induction rules in bounded arithmetic. Arch. Math. Log. 59 (3-4) (2020)
Emil Jerábek
Recursive functions and existentially closed structures. J. Math. Log. 20 (1) (2020)
Emil Jerábek
Rules with parameters in modal logic II. Ann. Pure Appl. Log. 171 (10) (2020)
Emil Jerábek
. CoRR (2020)
Emil Jerábek
On the proof complexity of logics of bounded branching. CoRR (2020)
Emil Jerábek
Rules with parameters in modal logic II. CoRR (2019)
Emil Jerábek
On the complexity of the clone membership problem. CoRR (2019)
Emil Jerábek
Rigid models of Presburger arithmetic. Math. Log. Q. 65 (1) (2019)
Emil Jerábek
Rigid models of Presburger arithmetic. CoRR (2018)
Emil Jerábek
Induction rules in bounded arithmetic. CoRR (2018)
Emil Jerábek
Recursive functions and existentially closed structures. CoRR (2017)
Emil Jerábek
Proof complexity of intuitionistic implicational formulas. Ann. Pure Appl. Log. 168 (1) (2017)
Emil Jerábek
Integer factoring and modular square roots. J. Comput. Syst. Sci. 82 (2) (2016)
Emil Jerábek
Galois connection for multiple-output operations. CoRR (2016)
Emil Jerábek
Division by zero. CoRR (2016)
Emil Jerábek
Division by zero. Arch. Math. Log. 55 (7-8) (2016)
Emil Jerábek
A note on the substructural hierarchy. Math. Log. Q. 62 (1-2) (2016)
Emil Jerábek
Cluster expansion and the boxdot conjecture. Math. Log. Q. 62 (6) (2016)
Emil Jerábek
Open induction in a bounded arithmetic for TC0. Arch. Math. Log. 54 (3-4) (2015)
Emil Jerábek
Blending margins: the modal logic K has nullary unification type. J. Log. Comput. 25 (5) (2015)
Emil Jerábek
A note on the substructural hierarchy. CoRR (2015)
Emil Jerábek
Rules with parameters in modal logic I. Ann. Pure Appl. Log. 166 (9) (2015)
Emil Jerábek
Proof complexity of intuitionistic implicational formulas. CoRR (2015)
Emil Jerábek
Open induction in a bounded arithmetic for TC^0. CoRR (2014)
Emil Jerábek, Leszek Aleksander Kolodziejczyk
Real closures of models of weak arithmetic. Arch. Math. Log. 52 (1-2) (2013)
Emil Jerábek
Rules with parameters in modal logic I CoRR (2013)
Emil Jerábek
Cluster expansion and the boxdot conjecture. CoRR (2013)
Emil Jerábek
The complexity of admissible rules of Łukasiewicz logic. J. Log. Comput. 23 (3) (2013)
Emil Jerábek
Root finding with threshold circuits. Theor. Comput. Sci. 462 (2012)
Emil Jerábek
Sequence encoding without induction CoRR (2012)
Emil Jerábek
The Ubiquity of conservative Translations. Rev. Symb. Log. 5 (4) (2012)
Emil Jerábek
Integer factoring and modular square roots CoRR (2012)
Emil Jerábek
Sequence encoding without induction. Math. Log. Q. 58 (3) (2012)
Emil Jerábek
Proofs with monotone cuts. Math. Log. Q. 58 (3) (2012)
Emil Jerábek, Phuong Nguyen
Simulating non-prenex cuts in quantified propositional calculus. Math. Log. Q. 57 (5) (2011)
Emil Jerábek
A sorting network in bounded arithmetic. Ann. Pure Appl. Log. 162 (4) (2011)
Emil Jerábek
. Ann. Pure Appl. Log. 162 (4) (2011)
Emil Jerábek
Blending margins CoRR (2011)
Emil Jerábek
The ubiquity of conservative translations CoRR (2011)
Emil Jerábek
The complexity of admissible rules of Lukasiewicz logic CoRR (2011)
Emil Jerábek
Root finding with threshold circuits CoRR (2011)
Emil Jerábek
Abelian groups and quadratic residues in weak arithmetic. Math. Log. Q. 56 (3) (2010)
Emil Jerábek
Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20 (2) (2010)
Emil Jerábek
Bases of Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20 (6) (2010)
Emil Jerábek
Approximate counting by hashing in bounded arithmetic. J. Symb. Log. 74 (3) (2009)
Emil Jerábek
Canonical rules. J. Symb. Log. 74 (4) (2009)
Emil Jerábek
Proof Complexity of the Cut-free Calculus of Structures. J. Log. Comput. 19 (2) (2009)
Emil Jerábek
Substitution Frege and extended Frege proof systems in non-classical logics. Ann. Pure Appl. Log. 159 (1-2) (2009)
Emil Jerábek
Independent Bases of Admissible Rules. Log. J. IGPL 16 (3) (2008)
Emil Jerábek
On Independence of Variants of the Weak Pigeonhole Principle. J. Log. Comput. 17 (3) (2007)
Michal Rössler, Emil Jerábek
Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bull. Symb. Log. 13 (1) (2007)
Emil Jerábek
Complexity of admissible rules. Arch. Math. Log. 46 (2) (2007)
Emil Jerábek
Approximate counting in bounded arithmetic. J. Symb. Log. 72 (3) (2007)
Emil Jerábek
Frege systems for extensible modal logics. Ann. Pure Appl. Log. 142 (1-3) (2006)
Emil Jerábek
The strength of sharply bounded induction. Math. Log. Q. 52 (6) (2006)
Emil Jerábek
Admissible Rules of Modal Logics. J. Log. Comput. 15 (4) (2005)
Emil Jerábek
Dual weak pigeonhole principle, Boolean complexity, and derandomization. Ann. Pure Appl. Log. 129 (1-3) (2004)
Emil Jerábek
A note on Grzegorczyk's logic. Math. Log. Q. 50 (3) (2004)