The following pages link to Emil Jeřábek (Q331053):
Displaying 50 items.
- Labeled sequent calculus for justification logics (Q331048) (← links)
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Division by zero (Q335000) (← links)
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames (Q477584) (← links)
- Construction of models of bounded arithmetic by restricted reduced powers (Q506954) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- The Dirac delta function in two settings of reverse mathematics (Q661294) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Complexity of admissible rules (Q868660) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- Integer factoring and modular square roots (Q896029) (← links)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic (Q929293) (← links)
- Pairs, sets and sequences in first-order theories (Q943342) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- On lengths of proofs in non-classical logics (Q1006613) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Proof theory for admissible rules (Q1023055) (← links)
- The strength of multilinear proofs (Q1024659) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Galois connection for multiple-output operations (Q1652848) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Real closures of models of weak arithmetic (Q1935370) (← links)
- Reverse-engineering reverse mathematics (Q1944329) (← links)
- Sequent calculi for intuitionistic Gödel-Löb logic (Q1982008) (← links)
- Rules with parameters in modal logic. II. (Q2004954) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
- Using Ramsey's theorem once (Q2274133) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Uniform interpolation and the existence of sequent calculi (Q2326416) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Rules with parameters in modal logic. I. (Q2346953) (← links)
- Herbrand consistency of some finite fragments of bounded arithmetical theories (Q2377353) (← links)
- Propositional proof systems and fast consistency provers (Q2469433) (← links)
- Full classical S5 in natural deduction with weak normalization (Q2478553) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Frege systems for extensible modal logics (Q2503409) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- A note on the substructural hierarchy (Q2793913) (← links)
