Emil Jerábek - RankMe

74 papers Journal 73

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Simplified Lower Bound for Implicational Logic. Bull. Symb. Log. Emil Jerábek
2024	J	`jnl`	A note on the Theory of Well Orders. Bull. Symb. Log. Emil Jerábek
2024	J	`jnl`	A note on the theory of well orders. CoRR Emil Jerábek
2024	J	`jnl`	On the theory of exponential integer parts. CoRR Emil Jerábek
2023	J	`jnl`	A note on the complexity of addition. CoRR Emil Jerábek
2023	J	`jnl`	A simplified lower bound for implicational logic. CoRR Emil Jerábek
2023	J	`jnl`	Elementary analytic functions in VTC0. Ann. Pure Appl. Log. Emil Jerábek
2023	J	`jnl`	Models of VTC 0 $\mathsf {VTC^0}$ as exponential integer parts. Math. Log. Q. Emil Jerábek
2023	J	`jnl`	On the proof complexity of logics of bounded branching. Ann. Pure Appl. Log. Emil Jerábek
2022	J	`jnl`	Elementary analytic functions in VTC CoRR Emil Jerábek
2022	J	`jnl`	Iterated multiplication in VTC Arch. Math. Log. Emil Jerábek
2022	J	`jnl`	Models of VTC CoRR Emil Jerábek
2022	J	`jnl`	The theory of hereditarily bounded sets. Math. Log. Q. Emil Jerábek
2021	J	`jnl`	On the Complexity of the Clone Membership Problem. Theory Comput. Syst. Emil Jerábek
2021	J	`jnl`	The theory of hereditarily bounded sets. CoRR Emil Jerábek
2020	J	`jnl`	Induction rules in bounded arithmetic. Arch. Math. Log. Emil Jerábek
2020	J	`jnl`	Iterated multiplication in VTC CoRR Emil Jerábek
2020	J	`jnl`	On the proof complexity of logics of bounded branching. CoRR Emil Jerábek
2020	J	`jnl`	Recursive functions and existentially closed structures. J. Math. Log. Emil Jerábek
2020	J	`jnl`	Rules with parameters in modal logic II. Ann. Pure Appl. Log. Emil Jerábek
2019	J	`jnl`	On the complexity of the clone membership problem. CoRR Emil Jerábek
2019	J	`jnl`	Rigid models of Presburger arithmetic. Math. Log. Q. Emil Jerábek
2019	J	`jnl`	Rules with parameters in modal logic II. CoRR Emil Jerábek
2018	J	`jnl`	Induction rules in bounded arithmetic. CoRR Emil Jerábek
2018	J	`jnl`	Rigid models of Presburger arithmetic. CoRR Emil Jerábek
2017	J	`jnl`	Proof complexity of intuitionistic implicational formulas. Ann. Pure Appl. Log. Emil Jerábek
2017	J	`jnl`	Recursive functions and existentially closed structures. CoRR Emil Jerábek
2016	J	`jnl`	A note on the substructural hierarchy. Math. Log. Q. Emil Jerábek
2016	J	`jnl`	Cluster expansion and the boxdot conjecture. Math. Log. Q. Emil Jerábek
2016	J	`jnl`	Division by zero. Arch. Math. Log. Emil Jerábek
2016	J	`jnl`	Division by zero. CoRR Emil Jerábek
2016	J	`jnl`	Galois connection for multiple-output operations. CoRR Emil Jerábek
2016	J	`jnl`	Integer factoring and modular square roots. J. Comput. Syst. Sci. Emil Jerábek
2015	J	`jnl`	A note on the substructural hierarchy. CoRR Emil Jerábek
2015	J	`jnl`	Blending margins: the modal logic K has nullary unification type. J. Log. Comput. Emil Jerábek
2015	—	`ed.`	Logic, Language, and Computation - 10th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2013, Gudauri, Georgia, September 23-27, 2013. Revised Selected Papers TbiLLC Martin Aher, Daniel Hole, Emil Jerábek, Clemens Kupke
2015	J	`jnl`	Open induction in a bounded arithmetic for TC0. Arch. Math. Log. Emil Jerábek
2015	J	`jnl`	Proof complexity of intuitionistic implicational formulas. CoRR Emil Jerábek
2015	J	`jnl`	Rules with parameters in modal logic I. Ann. Pure Appl. Log. Emil Jerábek
2014	J	`jnl`	Open induction in a bounded arithmetic for TC^0. CoRR Emil Jerábek
2013	J	`jnl`	Cluster expansion and the boxdot conjecture. CoRR Emil Jerábek
2013	J	`jnl`	Real closures of models of weak arithmetic. Arch. Math. Log. Emil Jerábek, Leszek Aleksander Kolodziejczyk
2013	J	`jnl`	Rules with parameters in modal logic I CoRR Emil Jerábek
2013	J	`jnl`	The complexity of admissible rules of Łukasiewicz logic. J. Log. Comput. Emil Jerábek
2012	J	`jnl`	Integer factoring and modular square roots CoRR Emil Jerábek
2012	J	`jnl`	Proofs with monotone cuts. Math. Log. Q. Emil Jerábek
2012	J	`jnl`	Root finding with threshold circuits. Theor. Comput. Sci. Emil Jerábek
2012	J	`jnl`	Sequence encoding without induction CoRR Emil Jerábek
2012	J	`jnl`	Sequence encoding without induction. Math. Log. Q. Emil Jerábek
2012	J	`jnl`	The Ubiquity of conservative Translations. Rev. Symb. Log. Emil Jerábek
2011	J	`jnl`	A sorting network in bounded arithmetic. Ann. Pure Appl. Log. Emil Jerábek
2011	J	`jnl`	Blending margins CoRR Emil Jerábek
2011	J	`jnl`	On theories of bounded arithmetic for NC Ann. Pure Appl. Log. Emil Jerábek
2011	J	`jnl`	Root finding with threshold circuits CoRR Emil Jerábek
2011	J	`jnl`	Simulating non-prenex cuts in quantified propositional calculus. Math. Log. Q. Emil Jerábek, Phuong Nguyen
2011	J	`jnl`	The complexity of admissible rules of Lukasiewicz logic CoRR Emil Jerábek
2011	J	`jnl`	The ubiquity of conservative translations CoRR Emil Jerábek
2010	J	`jnl`	Abelian groups and quadratic residues in weak arithmetic. Math. Log. Q. Emil Jerábek
2010	J	`jnl`	Admissible Rules of Lukasiewicz Logic. J. Log. Comput. Emil Jerábek
2010	J	`jnl`	Bases of Admissible Rules of Lukasiewicz Logic. J. Log. Comput. Emil Jerábek
2009	J	`jnl`	Approximate counting by hashing in bounded arithmetic. J. Symb. Log. Emil Jerábek
2009	J	`jnl`	Canonical rules. J. Symb. Log. Emil Jerábek
2009	J	`jnl`	Proof Complexity of the Cut-free Calculus of Structures. J. Log. Comput. Emil Jerábek
2009	J	`jnl`	Substitution Frege and extended Frege proof systems in non-classical logics. Ann. Pure Appl. Log. Emil Jerábek
2008	J	`jnl`	Independent Bases of Admissible Rules. Log. J. IGPL Emil Jerábek
2007	J	`jnl`	Approximate counting in bounded arithmetic. J. Symb. Log. Emil Jerábek
2007	J	`jnl`	Complexity of admissible rules. Arch. Math. Log. Emil Jerábek
2007	J	`jnl`	Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bull. Symb. Log. Michal Rössler, Emil Jerábek
2007	J	`jnl`	On Independence of Variants of the Weak Pigeonhole Principle. J. Log. Comput. Emil Jerábek
2006	J	`jnl`	Frege systems for extensible modal logics. Ann. Pure Appl. Log. Emil Jerábek
2006	J	`jnl`	The strength of sharply bounded induction. Math. Log. Q. Emil Jerábek
2005	J	`jnl`	Admissible Rules of Modal Logics. J. Log. Comput. Emil Jerábek
2004	J	`jnl`	A note on Grzegorczyk's logic. Math. Log. Q. Emil Jerábek
2004	J	`jnl`	Dual weak pigeonhole principle, Boolean complexity, and derandomization. Ann. Pure Appl. Log. Emil Jerábek