Search results for "Emil Jerábek"

Found 25 publication records. Showing 25 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Emil Jerábek	Sequence encoding without induction	CoRR	2012	DBLP BibTeX RDF
1	Emil Jerábek, Phuong Nguyen	Simulating non-prenex cuts in quantified propositional calculus.	Math. Log. Q.	2011	DBLP DOI BibTeX RDF
1	Emil Jerábek	A sorting network in bounded arithmetic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Emil Jerábek	On theories of bounded arithmetic for NC1.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Emil Jerábek	The complexity of admissible rules of Lukasiewicz logic	CoRR	2011	DBLP BibTeX RDF
1	Emil Jerábek	Root finding with threshold circuits	CoRR	2011	DBLP BibTeX RDF
1	Emil Jerábek	Blending margins	CoRR	2011	DBLP BibTeX RDF
1	Emil Jerábek	The ubiquity of conservative translations	CoRR	2011	DBLP BibTeX RDF
1	Emil Jerábek	Abelian groups and quadratic residues in weak arithmetic.	Math. Log. Q.	2010	DBLP DOI BibTeX RDF
1	Emil Jerábek	Bases of Admissible Rules of Lukasiewicz Logic.	J. Log. Comput.	2010	DBLP DOI BibTeX RDF
1	Emil Jerábek	Admissible Rules of Lukasiewicz Logic.	J. Log. Comput.	2010	DBLP DOI BibTeX RDF
1	Emil Jerábek	Canonical rules.	J. Symb. Log.	2009	DBLP BibTeX RDF
1	Emil Jerábek	Approximate counting by hashing in bounded arithmetic.	J. Symb. Log.	2009	DBLP BibTeX RDF
1	Emil Jerábek	Proof Complexity of the Cut-free Calculus of Structures.	J. Log. Comput.	2009	DBLP DOI BibTeX RDF
1	Emil Jerábek	Substitution Frege and extended Frege proof systems in non-classical logics.	Ann. Pure Appl. Logic	2009	DBLP DOI BibTeX RDF
1	Emil Jerábek	Independent Bases of Admissible Rules.	Logic Journal of the IGPL	2008	DBLP DOI BibTeX RDF
1	Emil Jerábek	Approximate counting in bounded arithmetic.	J. Symb. Log.	2007	DBLP BibTeX RDF
1	Michal Rössler, Emil Jerábek	Fragment of Nonstandard Analysis with a Finitary Consistency Proof.	Bulletin of Symbolic Logic	2007	DBLP BibTeX RDF
1	Emil Jerábek	On Independence of Variants of the Weak Pigeonhole Principle.	J. Log. Comput.	2007	DBLP DOI BibTeX RDF
1	Emil Jerábek	Complexity of admissible rules.	Arch. Math. Log.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03B45, 03D15, 03B55
1	Emil Jerábek	The strength of sharply bounded induction.	Math. Log. Q.	2006	DBLP DOI BibTeX RDF
1	Emil Jerábek	Frege systems for extensible modal logics.	Ann. Pure Appl. Logic	2006	DBLP DOI BibTeX RDF
1	Emil Jerábek	Admissible Rules of Modal Logics.	J. Log. Comput.	2005	DBLP DOI BibTeX RDF
1	Emil Jerábek	A note on Grzegorczyk's logic.	Math. Log. Q.	2004	DBLP DOI BibTeX RDF
1	Emil Jerábek	Dual weak pigeonhole principle, Boolean complexity, and derandomization.	Ann. Pure Appl. Logic	2004	DBLP DOI BibTeX RDF

Publications of "Emil Jerábek" ( http://dblp.L3S.de/Authors/Emil_Jerábek )