Emil Jerábek

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j24		Emil Jerábek, Leszek Aleksander Kolodziejczyk: Real closures of models of weak arithmetic. Arch. Math. Log. 52(1-2): 143-157 (2013)
	2012
j23		Emil Jerábek: Proofs with monotone cuts. Math. Log. Q. 58(3): 177-187 (2012)
j22		Emil Jerábek: Sequence encoding without induction. Math. Log. Q. 58(3): 244-248 (2012)
j21		Emil Jerábek: Root finding with threshold circuits. Theor. Comput. Sci. 462: 59-69 (2012)
i6		Emil Jerábek: Sequence encoding without induction. CoRR abs/1201.5835 (2012)
i5		Emil Jerábek: Integer factoring and modular square roots. CoRR abs/1207.5220 (2012)
	2011
j20		Emil Jerábek: On theories of bounded arithmetic for NC¹. Ann. Pure Appl. Logic 162(4): 322-340 (2011)
j19		Emil Jerábek: A sorting network in bounded arithmetic. Ann. Pure Appl. Logic 162(4): 341-355 (2011)
j18		Emil Jerábek, Phuong Nguyen: Simulating non-prenex cuts in quantified propositional calculus. Math. Log. Q. 57(5): 524-532 (2011)
i4		Emil Jerábek: Blending margins. CoRR abs/1108.6240 (2011)
i3		Emil Jerábek: The complexity of admissible rules of Lukasiewicz logic. CoRR abs/1108.6261 (2011)
i2		Emil Jerábek: The ubiquity of conservative translations. CoRR abs/1108.6263 (2011)
i1		Emil Jerábek: Root finding with threshold circuits. CoRR abs/1112.3925 (2011)
	2010
j17		Emil Jerábek: Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20(2): 425-447 (2010)
j16		Emil Jerábek: Bases of Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20(6): 1149-1163 (2010)
j15		Emil Jerábek: Abelian groups and quadratic residues in weak arithmetic. Math. Log. Q. 56(3): 262-278 (2010)
	2009
j14		Emil Jerábek: Substitution Frege and extended Frege proof systems in non-classical logics. Ann. Pure Appl. Logic 159(1-2): 1-48 (2009)
j13		Emil Jerábek: Approximate counting by hashing in bounded arithmetic. J. Symb. Log. 74(3): 829-860 (2009)
j12		Emil Jerábek: Canonical rules. J. Symb. Log. 74(4): 1171-1205 (2009)
j11		Emil Jerábek: Proof Complexity of the Cut-free Calculus of Structures. J. Log. Comput. 19(2): 323-339 (2009)
	2008
j10		Emil Jerábek: Independent Bases of Admissible Rules. Logic Journal of the IGPL 16(3): 249-267 (2008)
	2007
j9		Emil Jerábek: Complexity of admissible rules. Arch. Math. Log. 46(2): 73-92 (2007)
j8		Michal Rössler, Emil Jerábek: Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bulletin of Symbolic Logic 13(1): 54-70 (2007)
j7		Emil Jerábek: Approximate counting in bounded arithmetic. J. Symb. Log. 72(3): 959-993 (2007)
j6		Emil Jerábek: On Independence of Variants of the Weak Pigeonhole Principle. J. Log. Comput. 17(3): 587-604 (2007)
	2006
j5		Emil Jerábek: Frege systems for extensible modal logics. Ann. Pure Appl. Logic 142(1-3): 366-379 (2006)
j4		Emil Jerábek: The strength of sharply bounded induction. Math. Log. Q. 52(6): 613-624 (2006)
	2005
j3		Emil Jerábek: Admissible Rules of Modal Logics. J. Log. Comput. 15(4): 411-431 (2005)
	2004
j2		Emil Jerábek: Dual weak pigeonhole principle, Boolean complexity, and derandomization. Ann. Pure Appl. Logic 129(1-3): 1-37 (2004)
j1		Emil Jerábek: A note on Grzegorczyk's logic. Math. Log. Q. 50(3): 295-296 (2004)

Coauthor Index

1	Leszek Aleksander Kolodziejczyk	[j24]
2	Phuong Nguyen	[j18]
3	Michal Rössler	[j8]

Last update Thu May 23 18:55:02 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page