The following pages link to Jan Krajíček (Q226860):
Displaying 50 items.
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- Combinatorics of first order structures and propositional proof systems (Q701740) (← links)
- Substitutions into propositional tautologies (Q845921) (← links)
- Exponentiation and second-order bounded arithmetic (Q922540) (← links)
- The number of proof lines and the size of proofs in first order logic (Q1102280) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- On the structure of initial segments of models of arithmetic (Q1123890) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- Lifting independence results in bounded arithmetic (Q1283131) (← links)
- On induction-free provability (Q1353982) (← links)
- (Q1377578) (redirect page) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Embedding logics into product logic (Q1580660) (← links)
- A saturation property of structures obtained by forcing with a compact family of random variables (Q1935366) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- Tautologies from Pseudo-Random Generators (Q2736584) (← links)
- Uniform Families of Polynomial Equations Over a Finite Field and Structures Admitting an Euler Characteristic of Definable Sets (Q2766366) (← links)
- On the weak pigeonhole principle (Q2773242) (← links)
- Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator (Q2904626) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Unprovability of circuit upper bounds in Cook's theory PV (Q2980966) (← links)
- A feasible interpolation for random resolution (Q2980967) (← links)
- (Q3072543) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Fragments of Bounded Arithmetic and Bounded Query Classes (Q3137488) (← links)
- (Q3140634) (← links)
- (Q3343964) (← links)
- Some Theorems on the Lattice of Local Interpretability Types (Q3347872) (← links)
- (Q3359762) (← links)
- Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096) (← links)
- Quantified propositional calculi and fragments of bounded arithmetic (Q3472099) (← links)
- A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
- From Feasible Proofs to Feasible Computations (Q3586030) (← links)
- A note on proofs of falsehood (Q3770530) (← links)
- A Possible Modal Formulation of Comprehension Scheme (Q3786476) (← links)
- (Q3786479) (← links)
- Some Results and Problems in The Modal Set Theory MST (Q3800007) (← links)
- (Q3804701) (← links)
- (Q3829548) (← links)
- (Q4010360) (← links)
- (Q4035314) (← links)
- Interpolation by a Game (Q4224078) (← links)
- Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
- Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700) (← links)
- (Q4268484) (← links)
- Lower bounds to the size of constant-depth propositional proofs (Q4292593) (← links)
- An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (Q4308607) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
