Jerábek, Emil - Institute of Mathematics, Academy of Sciences of the Czech Republic

• Univerzita Karlova Filozoficka fakulta Provability Logic of the
• Simulating nonprenex cuts in quantified propositional calculus Emil Jerabek # Phuong Nguyen +
• Canonical rules Emil Jerabek
• Admissible rules of Lukasiewicz logic Emil Jerabek
• Approximate counting by hashing in bounded arithmetic Emil Jerabek
• Real closures of models of weak arithmetic Emil Jerabek
• Simulating non-prenex cuts in quantified propositional calculus Emil Jerabek
• Proofs with monotone cuts Emil Jerabek
• A sorting network in bounded arithmetic Emil Jerabek
• On theories of bounded arithmetic for NC1 Emil Jerabek
• Proof complexity of the cut-free calculus of structures Emil Jerabek
• On independence of variants of the weak pigeonhole principle Emil Jerabek
• Frege systems for extensible modal logics Emil Jerabek
• Complexity of Admissible Rules Emil Jerabek
• Charles University in Prague Faculty of Mathematics and Physics
• Dual weak pigeonhole principle, Boolean complexity, and derandomization
• SUBDIRECTLY IRREDUCIBLE NON-IDEMPOTENT LEFT SYMMETRIC LEFT DISTRIBUTIVE GROUPOIDS
• Admissible rules and Lukasiewicz logic Emil Jerabek
• Approximate counting in bounded Emil Jerabek
• Canonical rules Emil Jerabek
• Approximate counting in bounded Emil Jerabek
• On monotone sequent calculus Emil Jerabek
• jerabek@math.cas.cz University Unification
• Proofs with monotone cuts Emil Jerabek #
• On independence of variants of the weak pigeonhole principle Emil Jerabek #
• Abelian groups and quadratic residues in weak arithmetic Emil Jerabek
• Independent bases of admissible rules Emil Jerabek #
• Complexity of Admissible Rules Emil Jerabek #
• jerabek@math.cas.cz http://math.cas.cz/jerabek/ Mathematics
• Frege systems for extensible modal logics Emil Je r abek
• L/ukasiewicz jerabek@math.cas.cz http://math.cas.cz/jerabek/
• jerabek@math.cas.cz Mathematics
• FRAGMENT OF NONSTANDARD ANALYSIS WITH A FINITARY CONSISTENCY PROOF
• Charles University in Prague Faculty of Mathematics and Physics
• Substitution Frege and extended Frege proof systems in nonclassical logics
• A note on Grzegorczyk's logic Emil Jerabek
• Approximate arithmetic Emil
• Independent bases of admissible rules Emil Jerabek
• Admissible rules of modal logics Emil Jerabek
• Abelian groups and quadratic residues in weak arithmetic Emil Jerabek #
• Approximate arithmetic Emil
• Proof complexity of the cutfree calculus of structures Emil Jerabek
• Univerzita Karlova Filozofick Provability Logic of the
• Proof systems for modal logics Emil Jerabek
• Univerzita Karlova v Praze Matematicko-fyzikln fakulta
• Approximate counting in bounded arithmetic Emil Jerabek #
• Real closures of models of weak arithmetic Emil Jerabek # Leszek Aleksander Ko#lodziejczyk +
• Substitution Frege and extended Frege proof systems in non-classical logics
• Admissible rules of Lukasiewicz logic Emil Jerabek #
• The strength of sharply bounded induction Emil Jerabek #
• A note on Grzegorczyk's logic Emil Jerabek
• jerabek@math.cas.cz http://math.cas.cz/jerabek/ Mathematics
• On theories of bounded arithmetic for NC 1 Emil Jerabek #
• A sorting network in bounded arithmetic Emil Jerabek #
• Dual weak pigeonhole principle, Boolean complexity, and derandomization
• Bases of admissible rules of Lukasiewicz logic Emil Jerabek #
• Approximate counting by hashing in bounded arithmetic Emil Jerabek
• Canonical rules Emil Jerabek #
• Bases of admissible rules of Lukasiewicz logic Emil Jerabek
• The strength of sharply bounded induction Emil Jerabek
• Admissible rules of modal logics Emil Jerabek #
• Proofs with monotone cuts Emil Jerabek
• Approximate counting in bounded arithmetic Emil Jerabek
• The ubiquity of conservative translations Emil Jerabek
• The complexity of admissible rules of Lukasiewicz logic Emil Jerabek
• Blending margins Emil Jerabek #
• The ubiquity of conservative translations Emil Jerabek #
• The complexity of admissible rules of Lukasiewicz logic Emil Jerabek #
• Blending margins Emil Jerabek
• Sequence encoding without induction Emil Jerabek #
• Root finding with threshold circuits Emil Jerabek
• Root finding with threshold circuits Emil Jerabek
• Sequence encoding without induction Emil Jerabek