Jan Krajícek
Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic
https://zbmath.org/authors/?q=ai:krajicek.jan
https://mathgenealogy.org/id.php?id=291533
https://orcid.org/0000-0003-0670-3957
https://www.wikidata.org/entity/Q62560079
https://id.loc.gov/authorities/names/n92111152
https://d-nb.info/gnd/14367630X
Jan Krajícek
A Proof Complexity Conjecture and the Incompleteness Theorem.
1206-1210
2025
90
J. Symb. Log.
3
https://doi.org/10.1017/jsl.2023.69
https://www.wikidata.org/entity/Q122979466
db/journals/jsyml/jsyml90.html#Krajicek25
streams/journals/jsyml
Jan Krajícek
On NP ∩ coNP proof complexity generators.
2025
June
abs/2506.20221
CoRR
https://doi.org/10.48550/arXiv.2506.20221
db/journals/corr/corr2506.html#abs-2506-20221
streams/journals/corr
Jan Krajícek
On the existence of Strong Proof Complexity Generators.
20-40
2024
30
Bull. Symb. Log.
1
https://doi.org/10.1017/bsl.2023.40
db/journals/bsl/bsl30.html#Krajicek24
Jan Krajícek
The Cook-Reckhow Definition.
83-94
2023
Logic, Automata, and Computational Complexity
https://doi.org/10.1145/3588287.3588293
books/acm/23/K2023
db/books/collections/K2023.html#Krajicek23
Jan Krajícek
Extended Nullstellensatz proof systems.
2023
abs/2301.10617
CoRR
https://doi.org/10.48550/arXiv.2301.10617
db/journals/corr/corr2301.html#abs-2301-10617
Jan Krajícek
A proof complexity conjecture and the Incompleteness theorem.
2023
abs/2303.10637
CoRR
https://doi.org/10.48550/arXiv.2303.10637
db/journals/corr/corr2303.html#abs-2303-10637
Jan Krajícek
Extended Nullstellensatz proof systems.
TR23-007
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/007
db/journals/eccc/eccc2023.html#Krajicek23
Jan Krajícek
A proof complexity conjecture and the Incompleteness theorem.
TR23-030
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/030
db/journals/eccc/eccc2023.html#Krajicek23a
Jan Krajícek
Information in Propositional Proofs and Algorithmic Proof Search.
852-869
2022
87
J. Symb. Log.
2
https://doi.org/10.1017/jsl.2021.75
https://www.wikidata.org/entity/Q113858283
db/journals/jsyml/jsyml87.html#Krajicek22
Jan Krajícek
On the existence of strong proof complexity generators.
2022
abs/2208.11642
CoRR
https://doi.org/10.48550/arXiv.2208.11642
db/journals/corr/corr2208.html#abs-2208-11642
Jan Krajícek
On the existence of strong proof complexity generators.
TR22-120
2022
TR22
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2022/120
db/journals/eccc/eccc2022.html#Krajicek22
Jan Krajícek
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms.
11:1-11:4
2021
22
ACM Trans. Comput. Log.
2
https://doi.org/10.1145/3446207
db/journals/tocl/tocl22.html#Krajicek21
Jan Krajícek
Information in propositional proofs and algorithmic proof search.
2021
abs/2104.04711
CoRR
https://arxiv.org/abs/2104.04711
db/journals/corr/corr2104.html#abs-2104-04711
Jan Krajícek
Information in propositional proofs and algorithmic proof search.
TR21-053
2021
TR21
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2021/053
db/journals/eccc/eccc28.html#Krajicek21
Jan Bydzovsky
Jan Krajícek
Igor C. Oliveira 0001
Consistency of circuit lower bounds with bounded theories.
2020
16
Log. Methods Comput. Sci.
2
https://doi.org/10.23638/LMCS-16(2:12)2020
db/journals/lmcs/lmcs16.html#BydzovskyKO20
Jan Krajícek
A limitation on the KPT interpolation.
2020
16
Log. Methods Comput. Sci.
3
https://lmcs.episciences.org/6708
db/journals/lmcs/lmcs16.html#Krajicek20
Jan Krajícek
A limitation on the KPT interpolation.
2020
abs/2004.02448
CoRR
https://arxiv.org/abs/2004.02448
db/journals/corr/corr2004.html#abs-2004-02448
Jan Krajícek
Small circuits and dual weak PHP in the universal theory of p-time algorithms.
2020
abs/2004.11582
CoRR
https://arxiv.org/abs/2004.11582
db/journals/corr/corr2004.html#abs-2004-11582
Jan Bydzovsky
Jan Krajícek
Igor C. Oliveira 0001
Consistency of circuit lower bounds with bounded theories.
2019
abs/1905.12935
CoRR
http://arxiv.org/abs/1905.12935
db/journals/corr/corr1905.html#abs-1905-12935
Jan Krajícek
The Cook-Reckhow definition.
2019
abs/1909.03691
CoRR
http://arxiv.org/abs/1909.03691
db/journals/corr/corr1909.html#abs-1909-03691
Jan Bydzovsky
Igor Carboni Oliveira
Jan Krajícek
Consistency of circuit lower bounds with bounded theories.
TR19-077
2019
TR19
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2019/077
db/journals/eccc/eccc26.html#BydzovskyOK19
Jan Krajícek
Igor C. Oliveira 0001
On monotone circuits with local oracles and clique lower bounds.
2018
2018
Chic. J. Theor. Comput. Sci.
http://cjtcs.cs.uchicago.edu/articles/2018/1/contents.html
db/journals/cjtcs/cjtcs2018.html#KrajicekO18
Jan Krajícek
Randomized feasible interpolation and monotone circuits with a local oracle.
1850012:1-1850012:27
2018
18
J. Math. Log.
2
https://doi.org/10.1142/S0219061318500125
https://www.wikidata.org/entity/Q129592975
db/journals/jml/jml18.html#Krajicek18
Jan Krajícek
A feasible interpolation for random resolution.
2017
13
1
Log. Methods Comput. Sci.
https://doi.org/10.23638/LMCS-13(1:5)2017
http://arxiv.org/abs/1604.06560
db/journals/lmcs/lmcs13.html#Krajicek16
Jan Krajícek
Igor C. Oliveira 0001
Unprovability of circuit upper bounds in Cook's theory PV.
2017
13
1
Log. Methods Comput. Sci.
https://doi.org/10.23638/LMCS-13(1:4)2017
http://arxiv.org/abs/1605.00263
db/journals/lmcs/lmcs13.html#KrajicekO16
Jan Krajícek
Igor C. Oliveira 0001
On monotone circuits with local oracles and clique lower bounds.
2017
abs/1704.06241
CoRR
http://arxiv.org/abs/1704.06241
db/journals/corr/corr1704.html#KrajicekO17
Jan Krajícek
Randomized feasible interpolation and monotone circuits with a local oracle.
2016
abs/1611.08680
CoRR
http://arxiv.org/abs/1611.08680
db/journals/corr/corr1611.html#Krajicek16a
Jan Krajícek
Igor Carboni Oliveira
Unprovability of circuit upper bounds in Cook's theory PV.
TR16-071
2016
TR16
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2016/071
db/journals/eccc/eccc23.html#KrajicekO16
Jan Krajícek
Expansions of pseudofinite structures and circuit and proof complexity.
2015
abs/1505.00118
CoRR
http://arxiv.org/abs/1505.00118
db/journals/corr/corr1505.html#Krajicek15
Jan Krajícek
Consistency of circuit evaluation, extended resolution and total NP search problems.
2015
abs/1509.03048
CoRR
http://arxiv.org/abs/1509.03048
db/journals/corr/corr1509.html#Krajicek15a
Olaf Beyersdorff
Edward A. Hirsch
Jan Krajícek
Rahul Santhanam
Optimal algorithms and proofs (Dagstuhl Seminar 14421).
51-68
2014
4
Dagstuhl Reports
10
https://doi.org/10.4230/DagRep.4.10.51
db/journals/dagstuhl-reports/dagstuhl-reports4.html#BeyersdorffHKS14
Jan Krajícek
A saturation property of structures obtained by forcing with a compact family of random variables.
19-28
2013
52
Arch. Math. Log.
1-2
https://doi.org/10.1007/s00153-012-0304-9
db/journals/aml/aml52.html#Krajicek13
Jan Krajícek
A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems.
2013
CoRR
http://arxiv.org/abs/1311.2501
abs/1311.2501
db/journals/corr/corr1311.html#Krajicek13
Jan Krajícek
A reduction of proof complexity to computational complexity for AC<sup>0</sup>[p] Frege systems.
TR13-156
2013
TR13
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2013/156
db/journals/eccc/eccc20.html#Krajicek13
Jan Krajícek
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
https://doi.org/10.2168/LMCS-8(3:9)2012
http://arxiv.org/abs/1207.0393
2012
Log. Methods Comput. Sci.
8
3
db/journals/lmcs/lmcs8.html#abs-1207-0393
Jan Krajícek
A note on SAT algorithms and proof complexity.
490-493
2012
112
Inf. Process. Lett.
12
https://doi.org/10.1016/j.ipl.2012.03.009
db/journals/ipl/ipl112.html#Krajicek12
Jan Krajícek
On the computational complexity of finding hard tautologies
http://arxiv.org/abs/1212.1789
2012
CoRR
abs/1212.1789
db/journals/corr/corr1212.html#abs-1212-1789
Jan Krajícek
Forcing with Random Variables and Proof Complexity.
I-XVI, 1-247
Cambridge University Press
2011
London Mathematical Society lecture note series
382
978-0-521-15433-8
http://www.cambridge.org/de/academic/subjects/mathematics/logic-categories-and-sets/forcing-random-variables-and-proof-complexity?format=PB
Jan Krajícek
A note on propositional proof complexity of some Ramsey-type statements.
245-255
2011
50
Arch. Math. Log.
1-2
https://doi.org/10.1007/s00153-010-0212-9
db/journals/aml/aml50.html#Krajicek11
Jan Krajícek
On the Proof Complexity of the Nisan-Wigderson Generator based on a Hard NP ∩ coNP function.
2011
11
J. Math. Log.
1
https://doi.org/10.1142/S0219061311000979
db/journals/jml/jml11.html#Krajicek11
Jan Krajícek
A form of feasible interpolation for constant depth Frege systems.
774-784
2010
75
J. Symb. Log.
2
https://doi.org/10.2178/jsl/1268917504
http://projecteuclid.org/euclid.jsl/1268917504
db/journals/jsyml/jsyml75.html#Krajicek10
Jan Krajícek
From Feasible Proofs to Feasible Computations.
22-31
2010
CSL
https://doi.org/10.1007/978-3-642-15205-4_3
conf/csl/2010
db/conf/csl/csl2010.html#Krajicek10
Jan Krajícek
On the proof complexity of the Nisan-Wigderson generator based on a hard NP cap coNP function.
TR10-054
2010
TR10
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2010/054
db/journals/eccc/eccc17.html#Krajicek10
Jan Krajícek
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
227-237
2008
73
J. Symb. Log.
1
https://doi.org/10.2178/jsl/1208358751
http://projecteuclid.org/euclid.jsl/1208358751
db/journals/jsyml/jsyml73.html#Krajicek08
Jan Krajícek
Substitutions into propositional tautologies.
163-167
2007
101
Inf. Process. Lett.
4
https://doi.org/10.1016/j.ipl.2006.09.002
db/journals/ipl/ipl101.html#Krajicek07
Jan Krajícek
Alan Skelley
Neil Thapen
NP search problems in low fragments of bounded arithmetic.
649-672
2007
72
J. Symb. Log.
2
https://doi.org/10.2178/jsl/1185803628
http://projecteuclid.org/euclid.jsl/1185803628
db/journals/jsyml/jsyml72.html#KrajicekST07
Stephen A. Cook
Jan Krajícek
Consequences of the provability of <i>NP</i> ⊆ <i>P/poly</i>.
1353-1371
2007
72
J. Symb. Log.
4
https://doi.org/10.2178/jsl/1203350791
http://projecteuclid.org/euclid.jsl/1203350791
db/journals/jsyml/jsyml72.html#CookK07
Jan Krajícek
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
2007
TR07
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-007/index.html
TR07-007
db/journals/eccc/eccc14.html#Krajicek07
Jan Krajícek
Proof Complexity Generators.
3
2006
conf/acid/2006
ACiD
db/conf/acid/acid2006.html#Krajicek06
Jan Krajícek
Forcing with Random Variables and Proof Complexity.
277-278
2006
conf/cie/2006
CiE
https://doi.org/10.1007/11780342_29
db/conf/cie/cie2006.html#Krajicek06
Jan Krajícek
Hardness assumptions in the foundations of theoretical computer science.
667-675
2005
44
Arch. Math. Log.
6
https://doi.org/10.1007/s00153-005-0279-x
db/journals/aml/aml44.html#Krajicek05
Jan Krajícek
Structured pigeonhole principle, search problems and hard tautologies.
619-630
2005
70
J. Symb. Log.
2
https://doi.org/10.2178/jsl/1120224731
http://projecteuclid.org/euclid.jsl/1120224731
db/journals/jsyml/jsyml70.html#Krajicek05
Jan Krajícek
Combinatorics of first order structures and propositional proof systems.
427-441
2004
43
Arch. Math. Log.
4
https://doi.org/10.1007/s00153-003-0186-y
db/journals/aml/aml43.html#Krajicek04
Jan Krajícek
Approximate Euler characteristic, dimension, and weak pigeonhole principles.
201-214
2004
69
J. Symb. Log.
1
https://doi.org/10.2178/jsl/1080938837
http://projecteuclid.org/euclid.jsl/1080938837
db/journals/jsyml/jsyml69.html#Krajicek04
Jan Krajícek
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds.
265-286
2004
69
J. Symb. Log.
1
https://doi.org/10.2178/jsl/1080938841
http://projecteuclid.org/euclid.jsl/1080938841
db/journals/jsyml/jsyml69.html#Krajicek04a
Jan Krajícek
Implicit proofs.
387-397
2004
69
J. Symb. Log.
2
https://doi.org/10.2178/jsl/1082418532
http://projecteuclid.org/euclid.jsl/1082418532
db/journals/jsyml/jsyml69.html#Krajicek04b
Jan Krajícek
Diagonalization in proof complexity
Electron. Colloquium Comput. Complex.
2004
TR04
TR04-018
db/journals/eccc/eccc11.html#ECCC-TR04-018
https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-018/index.html
Jan Krajícek
Dehn Function and Length of Proofs.
527-541
2003
13
Int. J. Algebra Comput.
5
https://doi.org/10.1142/S0218196703001523
db/journals/ijac/ijac13.html#Krajicek03
Jan Krajícek
Implicit proofs
Electron. Colloquium Comput. Complex.
2003
TR03
TR03-055
db/journals/eccc/eccc10.html#ECCC-TR03-055
https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-055/index.html
Russell Impagliazzo
Jan Krajícek
A Note on Conservativity Relations among Bounded Arithmetic Theories.
375-377
2002
48
Math. Log. Q.
3
https://doi.org/10.1002/1521-3870(200204)48:3<375::AID-MALQ375>3.0.CO;2-L
db/journals/mlq/mlq48.html#ImpagliazzoK02
Jan Krajícek
Interpolation and Approximate Semantic Derivations.
602-606
2002
48
Math. Log. Q.
4
https://doi.org/10.1002/1521-3870(200211)48:4<602::AID-MALQ602>3.0.CO;2-J
db/journals/mlq/mlq48.html#Krajicek02
Jan Krajícek
Tautologies from pseudo-random generators.
197-212
2001
7
Bull. Symb. Log.
2
https://doi.org/10.2307/2687774
db/journals/bsl/bsl7.html#Krajicek01
Jan Krajícek
Thomas Scanlon
Combinatorics with definable sets: Euler characteristics and Grothendieck rings.
311-330
2000
6
Bull. Symb. Log.
3
https://doi.org/10.2307/421058
db/journals/bsl/bsl6.html#KrajicekS00
Jan Krajícek
Tautologies from pseudo-random generators
Electron. Colloquium Comput. Complex.
2000
TR00
TR00-033
db/journals/eccc/eccc7.html#ECCC-TR00-033
https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-033/index.html
Mario Chiari
Jan Krajícek
Lifting independence results in bounded arithmetic.
123-138
1999
38
Arch. Math. Log.
2
https://doi.org/10.1007/s001530050118
db/journals/aml/aml38.html#ChiariK99
Jan Krajícek
Pavel Pudlák
Some Consequences of Cryptographical Conjectures for S<sup>1</sup><sub>2</sub> and EF.
82-94
1998
140
Inf. Comput.
1
db/journals/iandc/iandc140.html#KrajicekP98
https://doi.org/10.1006/inco.1997.2674
https://www.wikidata.org/entity/Q106785148
Mario Chiari
Jan Krajícek
Witnessing Functions in Bounded Arithmetic and Search Problems.
1095-1115
1998
63
J. Symb. Log.
3
db/journals/jsyml/jsyml63.html#ChiariK98
https://doi.org/10.2307/2586729
http://projecteuclid.org/euclid.jsl/1183745583
Jan Krajícek
Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof System.
1582-1596
1998
63
J. Symb. Log.
4
db/journals/jsyml/jsyml63.html#Krajicek98
https://doi.org/10.2307/2586668
http://projecteuclid.org/euclid.jsl/1183745649
Jan Krajícek
Interpolation by a Game.
450-458
1998
44
Math. Log. Q.
db/journals/mlq/mlq44.html#Krajicek98
https://doi.org/10.1002/malq.19980440403
Matthias Baaz
Petr Hájek 0001
David Svejda
Jan Krajícek
Embedding Logics into Product Logic.
35-47
1998
61
Stud Logica
1
db/journals/sLogica/sLogica61.html#BaazHSK98
https://doi.org/10.1023/A:1005026229560
Samuel R. Buss
Russell Impagliazzo
Jan Krajícek
Pavel Pudlák
Alexander A. Razborov
Jirí Sgall
Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.
256-298
1997
6
Comput. Complex.
3
db/journals/cc/cc6.html#BussIPRS97
https://doi.org/10.1007/BF01294258
Jan Krajícek
Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic.
457-486
1997
62
J. Symb. Log.
2
db/journals/jsyml/jsyml62.html#Krajicek97
https://doi.org/10.2307/2275541
http://projecteuclid.org/euclid.jsl/1183745237
https://www.wikidata.org/entity/Q106785017
Jan Krajícek
Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus.
85-90
1997
conf/mfcs/1997
MFCS
db/conf/mfcs/mfcs97.html#Krajicek97
https://doi.org/10.1007/BFb0029951
Jan Krajícek
Interpolation by a Game
Electron. Colloquium Comput. Complex.
1997
TR97-015
TR97
db/journals/eccc/eccc4.html#ECCC-TR97-015
https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-015/index.html
Jan Krajícek
Bounded arithmetic, propositional logic, and complexity theory.
I-XIII, 1-343
Cambridge University Press
1995
Encyclopedia of mathematics and its applications
60
978-0-521-45205-2
Jan Krajícek
Pavel Pudlák
Alan R. Woods
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle.
15-40
1995
7
Random Struct. Algorithms
1
db/journals/rsa/rsa7.html#KrajicekPW95
https://doi.org/10.1002/rsa.3240070103
https://www.wikidata.org/entity/Q106785131
Jan Krajícek
Extensions of Models of PV.
104-114
1995
Logic Colloquium
https://doi.org/10.1007/978-3-662-22108-2_8
conf/logicColl/1995
db/conf/logicColl/logicColl1995.html#Krajicek95
Jan Krajícek
Lower Bounds to the Size of Constant-Depth Propositional Proofs.
73-86
1994
59
J. Symb. Log.
1
db/journals/jsyml/jsyml59.html#Krajicek94
https://doi.org/10.2307/2275250
http://projecteuclid.org/euclid.jsl/1183744434
Lower Bound on Hilbert's Nullstellensatz and propositional proofs
Paul Beame
Russell Impagliazzo
Jan Krajícek
Toniann Pitassi
Pavel Pudlák
794-806
conf/focs/FOCS35
1994
FOCS
db/conf/focs/focs94.html#BeameIKPP94
https://doi.org/10.1109/SFCS.1994.365714
https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365714
Jan Krajícek
Pavel Pudlák
Some Consequences of Cryptographical Conjectures for S_2^1 and EF.
210-220
1994
conf/lcc/1994
LCC
db/conf/lcc/lcc94.html#KrajicekP94
https://doi.org/10.1007/3-540-60178-3_86
Jan Krajícek
Pavel Pudlák
Alan R. Woods
An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
Electron. Colloquium Comput. Complex.
1994
TR94
TR94-018
db/journals/eccc/eccc1.html#ECCC-TR94-018
https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-018/index.html
Jan Krajícek
Gaisi Takeuti
On Induction-Free Provability.
1992
6
Ann. Math. Artif. Intell.
1-3
db/journals/amai/amai6.html#KrajicekT92
107-125
https://doi.org/10.1007/BF01531024
Exponential Lower Bounds for the Pigeonhole Principle
Paul Beame
Russell Impagliazzo
Jan Krajícek
Toniann Pitassi
Pavel Pudlák
Alan R. Woods
200-220
conf/stoc/STOC24
1992
STOC
db/conf/stoc/stoc92.html#BeameIKPPW92
https://doi.org/10.1145/129712.129733
Jan Krajícek
Pavel Pudlák
Gaisi Takeuti
Bounded Arithmetic and the Polynomial Hierarchy.
143-153
1991
52
Ann. Pure Appl. Log.
1-2
db/journals/apal/apal52.html#KrajicekPT91
https://doi.org/10.1016/0168-0072(91)90043-L
https://www.wikidata.org/entity/Q106785050
Jan Krajícek
Exponentiation and Second-Order Bounded Arithmetic.
261-276
1990
48
Ann. Pure Appl. Log.
3
db/journals/apal/apal48.html#Krajicek90
https://doi.org/10.1016/0168-0072(90)90023-U
Jan Krajícek
Pavel Pudlák
Quantified propositional calculi and fragments of bounded arithmetic.
29-46
1990
36
Math. Log. Q.
1
https://doi.org/10.1002/malq.19900360106
https://www.wikidata.org/entity/Q106785088
db/journals/mlq/mlq36.html#KrajicekP90
Jan Krajícek
Pavel Pudlák
Jirí Sgall
Interactive Computations of Optimal Solutions.
48-60
1990
conf/mfcs/1990
MFCS
db/conf/mfcs/mfcs90.html#KrajicekPS90
https://doi.org/10.1007/BFb0029595
Jan Krajícek
Pavel Pudlák
On the structure of initial segments of models of arithmetic.
91-98
1989
28
Arch. Math. Log.
2
https://doi.org/10.1007/BF01633984
db/journals/aml/aml28.html#KrajicekP89
Jan Krajícek
On the Number of Steps in Proofs.
153-178
1989
41
Ann. Pure Appl. Log.
2
db/journals/apal/apal41.html#Krajicek89
https://doi.org/10.1016/0168-0072(89)90012-2
Jan Krajícek
Pavel Pudlák
Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations.
1063-1079
1989
54
J. Symb. Log.
3
db/journals/jsyml/jsyml54.html#KrajicekP89
https://doi.org/10.2307/2274765
http://projecteuclid.org/euclid.jsl/1183743040
https://www.wikidata.org/entity/Q106785096
Jan Krajícek
Pavel Pudlák
Propositional Provability and Models of Weak Arithmetic.
193-210
1989
conf/csl/1989
CSL
db/conf/csl/csl89.html#KrajicekP89
https://doi.org/10.1007/3-540-52753-2_40
Jan Krajícek
Pavel Pudlák
The number of proof lines and the size of proofs in first order logic.
69-84
1988
27
Arch. Math. Log.
1
https://doi.org/10.1007/BF01625836
https://www.wikidata.org/entity/Q106785191
db/journals/aml/aml27.html#KrajicekP88
Jan Krajícek
Some Results and Problems in The Modal Set Theory MST.
123-134
1988
34
Math. Log. Q.
2
https://doi.org/10.1002/malq.19880340206
db/journals/mlq/mlq34.html#Krajicek88
Jan Krajícek
A note on proofs of falsehood.
169-176
1987
26
Arch. Math. Log.
1
https://doi.org/10.1007/BF02017501
db/journals/aml/aml26.html#Krajicek87
Jan Krajícek
A Possible Modal Formulation of Comprehension Scheme.
461-480
1987
33
Math. Log. Q.
5
https://doi.org/10.1002/malq.19870330511
db/journals/mlq/mlq33.html#Krajicek87
Jan Krajícek
Some Theorems on the Lattice of Local Interpretability Types.
449-460
1985
31
Math. Log. Q.
29-30
https://doi.org/10.1002/malq.19850312902
db/journals/mlq/mlq31.html#Krajicek85
Matthias Baaz
Paul Beame
Olaf Beyersdorff
Samuel R. Buss
Jan Bydzovsky
Mario Chiari
Stephen A. Cook
Petr Hájek 0001
Edward A. Hirsch
Russell Impagliazzo
Igor C. Oliveira 0001Igor Carboni Oliveira
Toniann Pitassi
Pavel Pudlák
Alexander A. Razborov
Rahul Santhanam
Thomas Scanlon
Jirí Sgall
Alan Skelley
David Svejda
Gaisi Takeuti
Neil Thapen
Alan R. Woods