Emil Jerábek

Orcid: 0000-0002-9057-3413

Affiliations:
  • Czech Academy of Sciences, Institute of Mathematics, Czech Republic


According to our database1, Emil Jerábek authored at least 53 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A note on the theory of well orders.
CoRR, 2024

On the theory of exponential integer parts.
CoRR, 2024

2023
Elementary analytic functions in VTC0.
Ann. Pure Appl. Log., June, 2023

Models of VTC 0 $\mathsf {VTC^0}$ as exponential integer parts.
Math. Log. Q., May, 2023

A note on the complexity of addition.
CoRR, 2023

A simplified lower bound for implicational logic.
CoRR, 2023

On the proof complexity of logics of bounded branching.
Ann. Pure Appl. Log., 2023

2022
The theory of hereditarily bounded sets.
Math. Log. Q., 2022

Models of VTC<sup>0</sup> as exponential integer parts.
CoRR, 2022

Elementary analytic functions in VTC<sup>0</sup>.
CoRR, 2022

Iterated multiplication in VTC <sup>0</sup>.
Arch. Math. Log., 2022

2021
On the Complexity of the Clone Membership Problem.
Theory Comput. Syst., 2021

2020
Recursive functions and existentially closed structures.
J. Math. Log., 2020

Rules with parameters in modal logic II.
Ann. Pure Appl. Log., 2020

Induction rules in bounded arithmetic.
Arch. Math. Log., 2020

2019
Rigid models of Presburger arithmetic.
Math. Log. Q., 2019

2017
Proof complexity of intuitionistic implicational formulas.
Ann. Pure Appl. Log., 2017

2016
Cluster expansion and the boxdot conjecture.
Math. Log. Q., 2016

A note on the substructural hierarchy.
Math. Log. Q., 2016

Integer factoring and modular square roots.
J. Comput. Syst. Sci., 2016

Galois connection for multiple-output operations.
CoRR, 2016

Division by zero.
Arch. Math. Log., 2016

2015
Blending margins: the modal logic K has nullary unification type.
J. Log. Comput., 2015

Rules with parameters in modal logic I.
Ann. Pure Appl. Log., 2015

Open induction in a bounded arithmetic for TC0.
Arch. Math. Log., 2015

2014
Open induction in a bounded arithmetic for TC^0.
CoRR, 2014

2013
The complexity of admissible rules of Łukasiewicz logic.
J. Log. Comput., 2013

Real closures of models of weak arithmetic.
Arch. Math. Log., 2013

2012
Root finding with threshold circuits.
Theor. Comput. Sci., 2012

The Ubiquity of conservative Translations.
Rev. Symb. Log., 2012

Sequence encoding without induction.
Math. Log. Q., 2012

Proofs with monotone cuts.
Math. Log. Q., 2012

2011
Simulating non-prenex cuts in quantified propositional calculus.
Math. Log. Q., 2011

Blending margins
CoRR, 2011

A sorting network in bounded arithmetic.
Ann. Pure Appl. Log., 2011

On theories of bounded arithmetic for NC<sup>1</sup>.
Ann. Pure Appl. Log., 2011

2010
Abelian groups and quadratic residues in weak arithmetic.
Math. Log. Q., 2010

Bases of Admissible Rules of Lukasiewicz Logic.
J. Log. Comput., 2010

Admissible Rules of Lukasiewicz Logic.
J. Log. Comput., 2010

2009
Proof Complexity of the Cut-free Calculus of Structures.
J. Log. Comput., 2009

Canonical rules.
J. Symb. Log., 2009

Approximate counting by hashing in bounded arithmetic.
J. Symb. Log., 2009

Substitution Frege and extended Frege proof systems in non-classical logics.
Ann. Pure Appl. Log., 2009

2008
Independent Bases of Admissible Rules.
Log. J. IGPL, 2008

2007
On Independence of Variants of the Weak Pigeonhole Principle.
J. Log. Comput., 2007

Approximate counting in bounded arithmetic.
J. Symb. Log., 2007

Fragment of Nonstandard Analysis with a Finitary Consistency Proof.
Bull. Symb. Log., 2007

Complexity of admissible rules.
Arch. Math. Log., 2007

2006
The strength of sharply bounded induction.
Math. Log. Q., 2006

Frege systems for extensible modal logics.
Ann. Pure Appl. Log., 2006

2005
Admissible Rules of Modal Logics.
J. Log. Comput., 2005

2004
A note on Grzegorczyk's logic.
Math. Log. Q., 2004

Dual weak pigeonhole principle, Boolean complexity, and derandomization.
Ann. Pure Appl. Log., 2004


  Loading...