We stand with Ukraine  

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 51 papers between 2004 and 2023.

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

2023
Elementary analytic functions in VTC0.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., June, 2023

Models of VTC 0 $\mathsf {VTC^0}$ as exponential integer parts.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., May, 2023

A note on the complexity of addition.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2023

A simplified lower bound for implicational logic.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2023

On the proof complexity of logics of bounded branching.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2023

2022
The theory of hereditarily bounded sets.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2022

Models of VTC<sup>0</sup> as exponential integer parts.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2022

Elementary analytic functions in VTC<sup>0</sup>.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2022

Iterated multiplication in VTC <sup>0</sup>.
[BibTeX]
[DOI]
Emil Jerábek
Arch. Math. Log., 2022

2021
On the Complexity of the Clone Membership Problem.
[BibTeX]
[DOI]
Emil Jerábek
Theory Comput. Syst., 2021

2020
Recursive functions and existentially closed structures.
[BibTeX]
[DOI]
Emil Jerábek
J. Math. Log., 2020

Rules with parameters in modal logic II.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2020

Induction rules in bounded arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
Arch. Math. Log., 2020

2019
Rigid models of Presburger arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2019

2017
Proof complexity of intuitionistic implicational formulas.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2017

2016
Cluster expansion and the boxdot conjecture.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2016

A note on the substructural hierarchy.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2016

Integer factoring and modular square roots.
[BibTeX]
[DOI]
Emil Jerábek
J. Comput. Syst. Sci., 2016

Galois connection for multiple-output operations.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2016

Division by zero.
[BibTeX]
[DOI]
Emil Jerábek
Arch. Math. Log., 2016

2015
Blending margins: the modal logic K has nullary unification type.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2015

Rules with parameters in modal logic I.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2015

Open induction in a bounded arithmetic for TC0.
[BibTeX]
[DOI]
Emil Jerábek
Arch. Math. Log., 2015

2014
Open induction in a bounded arithmetic for TC^0.
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2014

2013
The complexity of admissible rules of Łukasiewicz logic.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2013

Real closures of models of weak arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
,
Leszek Aleksander Kolodziejczyk
Arch. Math. Log., 2013

2012
Root finding with threshold circuits.
[BibTeX]
[DOI]
Emil Jerábek
Theor. Comput. Sci., 2012

The Ubiquity of conservative Translations.
[BibTeX]
[DOI]
Emil Jerábek
Rev. Symb. Log., 2012

Sequence encoding without induction.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2012

Proofs with monotone cuts.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2012

2011
Simulating non-prenex cuts in quantified propositional calculus.
[BibTeX]
[DOI]
Emil Jerábek
,
Phuong Nguyen
Math. Log. Q., 2011

Blending margins
[BibTeX]
[DOI]
Emil Jerábek
CoRR, 2011

A sorting network in bounded arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2011

On theories of bounded arithmetic for NC<sup>1</sup>.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2011

2010
Abelian groups and quadratic residues in weak arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2010

Bases of Admissible Rules of Lukasiewicz Logic.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2010

Admissible Rules of Lukasiewicz Logic.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2010

2009
Proof Complexity of the Cut-free Calculus of Structures.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2009

Canonical rules.
[BibTeX]
[DOI]
Emil Jerábek
J. Symb. Log., 2009

Approximate counting by hashing in bounded arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
J. Symb. Log., 2009

Substitution Frege and extended Frege proof systems in non-classical logics.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2009

2008
Independent Bases of Admissible Rules.
[BibTeX]
[DOI]
Emil Jerábek
Log. J. IGPL, 2008

2007
On Independence of Variants of the Weak Pigeonhole Principle.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2007

Approximate counting in bounded arithmetic.
[BibTeX]
[DOI]
Emil Jerábek
J. Symb. Log., 2007

Fragment of Nonstandard Analysis with a Finitary Consistency Proof.
[BibTeX]
[DOI]
Michal Rössler
,
Emil Jerábek
Bull. Symb. Log., 2007

Complexity of admissible rules.
[BibTeX]
[DOI]
Emil Jerábek
Arch. Math. Log., 2007

2006
The strength of sharply bounded induction.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2006

Frege systems for extensible modal logics.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2006

2005
Admissible Rules of Modal Logics.
[BibTeX]
[DOI]
Emil Jerábek
J. Log. Comput., 2005

2004
A note on Grzegorczyk's logic.
[BibTeX]
[DOI]
Emil Jerábek
Math. Log. Q., 2004

Dual weak pigeonhole principle, Boolean complexity, and derandomization.
[BibTeX]
[DOI]
Emil Jerábek
Ann. Pure Appl. Log., 2004


  Loading...