Emil Jerábek

发表

Substitution Frege and extended Frege proof systems in non-classical logics

Emil Jerábek, Emil Jeřábek, 2009, Ann. Pure Appl. Log..

Admissible Rules of Modal Logics

Emil Jerábek, Emil Jeřábek, 2005, J. Log. Comput..

On Independence of Variants of the Weak Pigeonhole Principle

Emil Jerábek, 2007, J. Log. Comput..

Rules with parameters in modal logic II

Emil Jerábek, 2020, Ann. Pure Appl. Log..

Blending margins pdf

Emil Jerábek, 2011, ArXiv.

Cluster expansion and the boxdot conjecture pdf

Emil Jerábek, 2016, Math. Log. Q..

On the complexity of the clone membership problem pdf

Emil Jerábek, 2019, ArXiv.

Independent Bases of Admissible Rules

Emil Jerábek, Emil Jeřábek, 2008, Log. J. IGPL.

Induction rules in bounded arithmetic

Emil Jerábek, 2020, Arch. Math. Log..

Simulating non-prenex cuts in quantified propositional calculus

Phuong Nguyen, Emil Jerábek, 2011, Math. Log. Q..

Division by zero

Emil Jerábek, Emil Jeřábek, 2016, Arch. Math. Log..

Abelian groups and quadratic residues in weak arithmetic

Emil Jerábek, 2010, Math. Log. Q..

Frege systems for extensible modal logics

Emil Jerábek, Emil Jeřábek, 2006, Ann. Pure Appl. Log..

On the proof complexity of logics of bounded branching pdf

Emil Jerábek, 2020, ArXiv.

Fragment of Nonstandard Analysis with a Finitary Consistency Proof

Emil Jerábek, Michal Rössler, 2007, Bull. Symb. Log..

Bases of Admissible Rules of Lukasiewicz Logic

Emil Jerábek, 2010, J. Log. Comput..

A sorting network in bounded arithmetic

Emil Jerábek, Emil Jeřábek, 2011, Ann. Pure Appl. Log..

Rigid models of Presburger arithmetic pdf

Emil Jerábek, 2019, Math. Log. Q..

Sequence encoding without induction pdf

Emil Jerábek, Emil Jeřábek, 2012, Math. Log. Q..

On theories of bounded arithmetic for NC1

Emil Jerábek, Emil Jeřábek, 2011, Ann. Pure Appl. Log..

Integer factoring and modular square roots

Emil Jerábek, 2016, J. Comput. Syst. Sci..

A note on the substructural hierarchy

Emil Jerábek, Emil Jeřábek, 2015, Math. Log. Q..

Admissible Rules of Lukasiewicz Logic

Emil Jerábek, 2010, J. Log. Comput..

Iterated multiplication in VTC0 pdf

Emil Jerábek, 2020, ArXiv.

Root finding with threshold circuits

Emil Jerábek, Emil Jerábek, Emil Jeřábek, 2012, Theor. Comput. Sci..

Proof Complexity of the Cut-free Calculus of Structures

Emil Jerábek, Emil Jeřábek, 2009, J. Log. Comput..

The Ubiquity of conservative Translations

Emil Jerábek, 2012, Rev. Symb. Log..

Open induction in a bounded arithmetic for TC0

Emil Jerábek, 2015, Arch. Math. Log..

Recursive functions and existentially closed structures pdf

Emil Jerábek, 2020, J. Math. Log..

Dual weak pigeonhole principle, Boolean complexity, and derandomization

Emil Jerábek, Emil Jerábek, Emil Jeřábek, 2004, Annals of Pure and Applied Logic.

A note on Grzegorczyk's logic

Emil Jerábek, 2004, Math. Log. Q..

Real closures of models of weak arithmetic

Leszek Aleksander Kolodziejczyk, Emil Jerábek, L. Kolodziejczyk, 2013, Arch. Math. Log..

Approximate counting in bounded arithmetic

Emil Jerábek, 2007, J. Symb. Log..

Proofs with monotone cuts

Emil Jerábek, Emil Jeřábek, 2012, Math. Log. Q..

Blending margins: the modal logic K has nullary unification type

Emil Jerábek, Emil Jeřábek, 2015, J. Log. Comput..

Galois connection for multiple-output operations

Emil Jerábek, 2016, ArXiv.

Approximate counting by hashing in bounded arithmetic

Emil Jerábek, 2009, J. Symb. Log..

Proof complexity of intuitionistic implicational formulas

Emil Jerábek, Emil Jeřábek, 2017, Ann. Pure Appl. Log..

The strength of sharply bounded induction

Emil Jerábek, 2006, Math. Log. Q..

Complexity of admissible rules

Emil Jerábek, Emil Jeřábek, 2007, Arch. Math. Log..

The complexity of admissible rules of Łukasiewicz logic

Emil Jerábek, 2013, J. Log. Comput..

Rules with parameters in modal logic I pdf

Emil Jerábek, Emil Jeřábek, 2015, Ann. Pure Appl. Log..

Canonical rules

Emil Jerábek, 2009, J. Symb. Log..

The theory of hereditarily bounded sets pdf

Emil Jerábek, Emil Jeřábek, 2022, Math. Log. Q..