
Pavel Pudlák
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j64]Pavel Pudlák:
The canonical pairs of bounded depth Frege systems. Ann. Pure Appl. Log. 172(2): 102892 (2021) - 2020
- [j63]Dmitry Gavinsky, Pavel Pudlák:
Santha-Vazirani sources, deterministic condensers and very strong extractors. Theory Comput. Syst. 64(6): 1140-1154 (2020) - [i40]Pavel Pudlák:
On matrices potentially useful for tree codes. CoRR abs/2012.03013 (2020)
2010 – 2019
- 2019
- [j62]Pavel Pudlák, Neil Thapen:
Random resolution refutations. Comput. Complex. 28(2): 185-239 (2019) - [j61]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. ACM Trans. Comput. Theory 11(4): 22:1-22:31 (2019) - [i39]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. CoRR abs/1904.07949 (2019) - [i38]Dmitry Gavinsky, Pavel Pudlák:
Santha-Vazirani sources, deterministic condensers and very strong extractors. CoRR abs/1907.04640 (2019) - [i37]Pavel Pudlák:
The canonical pairs of bounded depth Frege systems. CoRR abs/1912.03013 (2019) - [i36]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. Electron. Colloquium Comput. Complex. 26: 58 (2019) - 2018
- [j60]Pavel Hrubes, Pavel Pudlák:
A note on monotone real circuits. Inf. Process. Lett. 131: 15-19 (2018) - [c48]Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák:
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. SODA 2018: 247-261 - [i35]Albert Atserias, Jakob Nordström, Pavel Pudlák, Rahul Santhanam:
Proof Complexity (Dagstuhl Seminar 18051). Dagstuhl Reports 8(1): 124-157 (2018) - 2017
- [j59]Pavel Pudlák:
Incompleteness in the finite Domain. Bull. Symb. Log. 23(4): 405-441 (2017) - [j58]Massimo Lauria
, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Comb. 37(2): 253-268 (2017) - [j57]Pavel Pudlák:
Petr Hajek, 1940-2016. Bull. EATCS 121 (2017) - [j56]Petr Glivický
, Pavel Pudlák:
A wild model of linear arithmetic and discretely ordered modules. Math. Log. Q. 63(6): 501-508 (2017) - [j55]Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. Theory Comput. Syst. 60(3): 378-395 (2017) - [c47]Pavel Pudlák, Neil Thapen:
Random Resolution Refutations. Computational Complexity Conference 2017: 1:1-1:10 - [c46]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. Computational Complexity Conference 2017: 3:1-3:14 - [c45]Pavel Hrubes, Pavel Pudlák:
Random Formulas, Monotone Circuits, and Interpolation. FOCS 2017: 121-131 - [c44]Pavel Pudlák, Dominik Scheder, Navid Talebanfard
:
Tighter Hard Instances for PPSZ. ICALP 2017: 85:1-85:13 - [i34]Pavel Hrubes, Pavel Pudlák:
Random formulas, monotone circuits, and interpolation. Electron. Colloquium Comput. Complex. 24: 42 (2017) - [i33]Pavel Hrubes, Pavel Pudlák:
A note on monotone real circuits. Electron. Colloquium Comput. Complex. 24: 48 (2017) - [i32]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. Electron. Colloquium Comput. Complex. 24: 106 (2017) - 2016
- [r2]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2016: 170-174 - [i31]Pavel Pudlák, Dominik Scheder, Navid Talebanfard:
Tighter Hard Instances for PPSZ. CoRR abs/1611.01291 (2016) - [i30]Pavel Pudlák, Neil Thapen:
Random resolution refutations. Electron. Colloquium Comput. Complex. 23: 175 (2016) - 2015
- [j54]Pavel Pudlák:
On the complexity of finding falsifying assignments for Herbrand disjunctions. Arch. Math. Log. 54(7-8): 769-783 (2015) - [c43]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The Space Complexity of Cutting Planes Refutations. Computational Complexity Conference 2015: 433-447 - [i29]Dmitry Gavinsky, Pavel Pudlák:
On the Entropy of Locally-Independent Bernoulli Trials. CoRR abs/1503.08154 (2015) - 2014
- [j53]Arnold Beckmann
, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. ACM Trans. Comput. Log. 15(2): 17:1-17:30 (2014) - [c42]Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. STACS 2014: 325-336 - [i28]Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. CoRR abs/1401.5781 (2014) - [i27]Pavel Pudlák:
On the complexity of finding falsifying assignments for Herbrand disjunctions. CoRR abs/1411.3304 (2014) - [i26]Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. Electron. Colloquium Comput. Complex. 21: 11 (2014) - [i25]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The space complexity of cutting planes refutations. Electron. Colloquium Comput. Complex. 21: 138 (2014) - 2013
- [b2]Pavel Pudlák:
Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction. Springer monographs in mathematics, Springer 2013, ISBN 978-3-319-00118-0, pp. I-XIV, 1-695 - [j52]Anna Gál, Kristoffer Arnsfelt Hansen
, Michal Koucký
, Pavel Pudlák, Emanuele Viola:
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory 59(10): 6611-6627 (2013) - [c41]Massimo Lauria
, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) 2013: 684-695 - [c40]Arnold Beckmann, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. MFCS 2013: 111-122 - [p1]Pavel Pudlák, Jirí Sgall
:
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. The Mathematics of Paul Erdős I 2013: 399-407 - [i24]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. CoRR abs/1303.3166 (2013) - [i23]Pavel Pudlák:
Linear tree codes and the problem of explicit constructions. CoRR abs/1310.5684 (2013) - [i22]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. 20: 38 (2013) - [i21]Pavel Pudlák, Arnold Beckmann, Neil Thapen:
Parity Games and Propositional Proofs. Electron. Colloquium Comput. Complex. 20: 92 (2013) - 2012
- [j51]Pavel Pudlák, Neil Thapen:
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Ann. Pure Appl. Log. 163(5): 604-614 (2012) - [j50]Pavel Pudlák:
A lower bound on the size of resolution proofs of the Ramsey theorem. Inf. Process. Lett. 112(14-15): 610-611 (2012) - [c39]Anna Gál, Kristoffer Arnsfelt Hansen
, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC 2012: 479-494 - 2011
- [c38]Michal Koucký
, Prajakta Nimbhorkar, Pavel Pudlák:
Pseudorandom generators for group products: extended abstract. STOC 2011: 263-272 - [i20]Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. 18: 150 (2011) - [i19]Pavel Pudlák:
A lower bound on the size of resolution proofs of the Ramsey theorem. Electron. Colloquium Comput. Complex. 18: 162 (2011) - 2010
- [j49]Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl:
Some constructive bounds on Ramsey numbers. J. Comb. Theory, Ser. B 100(5): 439-445 (2010) - [j48]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov
, Pavel Pudlák:
On convex complexity measures. Theor. Comput. Sci. 411(16-18): 1842-1854 (2010) - [c37]Pavel Pudlák:
On extracting computations from propositional proofs (a survey). FSTTCS 2010: 30-41 - [c36]Ramamohan Paturi, Pavel Pudlák:
On the complexity of circuit satisfiability. STOC 2010: 241-250 - [i18]Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák:
Pseudorandom Generators for Group Products. Electron. Colloquium Comput. Complex. 17: 113 (2010)
2000 – 2009
- 2009
- [j47]Pavel Pudlák:
Quantum deduction rules. Ann. Pure Appl. Log. 157(1): 16-29 (2009) - [i17]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák:
On convex complexity measures. Electron. Colloquium Comput. Complex. 16: 40 (2009) - 2008
- [j46]Pavel Pudlák:
Fragments of bounded arithmetic and the lengths of proofs. J. Symb. Log. 73(4): 1389-1406 (2008) - [c35]Dmitry Gavinsky, Pavel Pudlák:
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity. Computational Complexity Conference 2008: 332-339 - [c34]Pavel Pudlák:
Twelve Problems in Proof Complexity. CSR 2008: 13-27 - [r1]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2008 - 2007
- [i16]Pavel Pudlák:
Quantum deduction rules. Electron. Colloquium Comput. Complex. 14(032) (2007) - [i15]Dmitry Gavinsky, Pavel Pudlák:
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity. Electron. Colloquium Comput. Complex. 14(074) (2007) - 2006
- [j45]Pavel Pudlák:
Gödel and computations: a 100th anniversary retrospective. SIGACT News 37(4): 13-21 (2006) - [c33]Pavel Pudlák:
On Search Problems in Complexity Theory and in Logic (Abstract). CIAC 2006: 5 - [c32]Pavel Pudlák:
Godel and Computations (Abstract). Computational Complexity Conference 2006: 3-5 - [c31]Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien:
Lower bounds for circuits with MOD_m gates. FOCS 2006: 709-718 - [e1]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i14]Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i13]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - 2005
- [j44]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An improved exponential-time algorithm for k-SAT. J. ACM 52(3): 337-364 (2005) - [c30]Michal Koucký, Pavel Pudlák, Denis Thérien:
Bounded-depth circuits: separating wires from gates. STOC 2005: 257-265 - [i12]Pavel Pudlák:
A nonlinear bound on the number of wires in bounded depth circuits. Electron. Colloquium Comput. Complex.(122) (2005) - 2004
- [i11]Ramamohan Paturi, Pavel Pudlák:
Circuit lower bounds and linear codes. Electron. Colloquium Comput. Complex.(004) (2004) - 2003
- [j43]Pavel Pudlák:
An Application of Hindman's Theorem to a Problem on Communication Complexity. Comb. Probab. Comput. 12(5-6): 661-670 (2003) - [j42]Anna Gál, Pavel Pudlák:
A note on monotone complexity and the rank of matrices. Inf. Process. Lett. 87(6): 321-326 (2003) - [j41]Anna Gál, Pavel Pudlák:
Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. Inf. Process. Lett. 88(5): 257 (2003) - [j40]Pavel Pudlák:
Parallel strategies. J. Symb. Log. 68(4): 1242-1250 (2003) - [j39]Pavel Pudlák:
On reducibility and symmetry of disjoint NP pairs. Theor. Comput. Sci. 295: 323-339 (2003) - 2002
- [j38]Pavel Pudlák:
Cycles of Nonzero Elements in Low Rank Matrices. Comb. 22(2): 321-334 (2002) - [j37]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65(4): 626-638 (2002) - [i10]Pavel Pudlák:
Monotone complexity and the rank of matrices. Electron. Colloquium Comput. Complex.(007) (2002) - 2001
- [j36]Samuel R. Buss, Pavel Pudlák:
On the computational content of intuitionistic propositional proofs. Ann. Pure Appl. Log. 109(1-2): 49-63 (2001) - [j35]Pavel Pudlák:
Complexity Theory and Genetics: The Computational Power of Crossing Over. Inf. Comput. 171(2): 201-223 (2001) - [j34]Pavel Pudlák:
Gust Editor's Foreword. J. Comput. Syst. Sci. 63(2): 147 (2001) - [c29]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone Simulations of Nonmonotone Proofs. Computational Complexity Conference 2001: 36-41 - [c28]Pavel Pudlák:
On Reducibility and Symmetry of Disjoint NP-Pairs. MFCS 2001: 621-632 - [i9]Pavel Pudlák:
On reducibility and symmetry of disjoint NP-pairs. Electron. Colloquium Comput. Complex. 8(44) (2001) - 2000
- [j33]Pavel Pudlák:
A note on the use of determinant for proving lower bounds on the size of linear circuits. Inf. Process. Lett. 74(5-6): 197-201 (2000) - [j32]Pavel Pudlák:
Proofs as Games. Am. Math. Mon. 107(6): 541-550 (2000) - [j31]Bruno Codenotti, Pavel Pudlák, Giovanni Resta:
Some structural properties of low-rank matrices related to computational complexity. Theor. Comput. Sci. 235(1): 89-107 (2000) - [c27]Pavel Pudlák, Russell Impagliazzo:
A lower bound for DLL algorithms for k-SAT (preliminary version). SODA 2000: 128-136 - [i8]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone simulations of nonmonotone propositional proofs. Electron. Colloquium Comput. Complex. 7(87) (2000)
1990 – 1999
- 1999
- [j30]Pavel Pudlák:
A Note on Applicability of the Incompleteness Theorem to Human Mind. Ann. Pure Appl. Log. 96(1-3): 335-342 (1999) - [j29]Russell Impagliazzo, Pavel Pudlák, Jirí Sgall
:
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. Comput. Complex. 8(2): 127-144 (1999) - [j28]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. Chic. J. Theor. Comput. Sci. 1999 (1999) - 1998
- [j27]Matthias Krause, Pavel Pudlák:
Computing Boolean Functions by Polynomials and Threshold Circuits. Comput. Complex. 7(4): 346-370 (1998) - [j26]Jan Krajícek, Pavel Pudlák:
Some Consequences of Cryptographical Conjectures for S12 and EF. Inf. Comput. 140(1): 82-94 (1998) - [c26]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An Improved Exponential-Time Algorithm for k-SAT. FOCS 1998: 628-637 - [c25]Pavel Pudlák:
Satisfiability - Algorithms and Logic. MFCS 1998: 129-141 - [i7]Pavel Pudlák:
A Note On the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits. Electron. Colloquium Comput. Complex. 5(42) (1998) - 1997
- [j25]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. Comput. Complex. 6(3): 256-298 (1997) - [j24]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Check Matrices. Des. Codes Cryptogr. 12(2): 107-130 (1997) - [j23]Pavel Pudlák:
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations. J. Symb. Log. 62(3): 981-998 (1997) - [j22]Pavel Pudlák, Vojtech Rödl, Jirí Sgall:
Boolean Circuits, Tensor Ranks, and Communication Complexity. SIAM J. Comput. 26(3): 605-633 (1997) - [j21]Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. Theor. Comput. Sci. 174(1-2): 137-156 (1997) - [c24]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. FOCS 1997: 566-574 - [i6]Russell Impagliazzo, Pavel Pudlák, Jirí Sgall:
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm. Electron. Colloquium Comput. Complex. 4(42) (1997) - [i5]Bruno Codenotti, Pavel Pudlák, Giovanni Resta:
Some structural properties of low rank matrices related to computational complexity. Electron. Colloquium Comput. Complex. 4(43) (1997) - 1996
- [c23]Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract). COCOON 1996: 41-49 - [c22]Pavel Pudlák, Jirí Sgall:
Algebraic models of computation and interpolation for algebraic proof systems. Proof Complexity and Feasible Arithmetics 1996: 279-295 - 1995
- [j20]Johan Håstad
, Stasys Jukna, Pavel Pudlák:
Top-Down Lower Bounds for Depth-Three Circuits. Comput. Complex. 5(2): 99-112 (1995) - [j19]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. Random Struct. Algorithms 7(1): 15-40 (1995) - [c21]Matthias Krause, Pavel Pudlák:
On Computing Boolean Functions by Sparse Real Polynomials. FOCS 1995: 682-691 - [i4]Pavel Pudlák, Jirí Sgall:
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. Electron. Colloquium Comput. Complex. 2(10) (1995) - 1994
- [j18]Pavel Pudlák:
Communication in Bounded Depth Circuits. Comb. 14(2): 203-216 (1994) - [j17]Pavel Pudlák, Vojtech Rödl:
Some combinatorial-algebraic problems from complexity theory. Discret. Math. 136(1-3): 253-279 (1994) - [j16]Noga Alon, Pavel Pudlák:
Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). J. Comput. Syst. Sci. 48(1): 194-202 (1994) - [c20]Pavel Pudlák:
Complexity Theory and Genetics. Computational Complexity Conference 1994: 383-395 - [c19]Pavel Pudlák, Samuel R. Buss:
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. CSL 1994: 151-162 - [c18]Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák:
Lower Bound on Hilbert's Nullstellensatz and propositional proofs. FOCS 1994: 794-806 - [c17]Pavel Pudlák:
Unexpected Upper Bounds on the Complexity of Some Communication Games. ICALP 1994: 1-10 - [c16]Jan Krajícek, Pavel Pudlák:
Some Consequences of Cryptographical Conjectures for S_2^1 and EF. LCC 1994: 210-220 - [c15]Matthias Krause, Pavel Pudlák:
On the computational power of depth 2 circuits with threshold and modulo gates. STOC 1994: 48-57 - [i3]Pavel Pudlák:
Complexity Theory and Genetics (extended abstract). Electron. Colloquium Comput. Complex. 1(13) (1994) - [i2]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. 1(18) (1994) - [i1]Matthias Krause, Pavel Pudlák:
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates. Electron. Colloquium Comput. Complex. 1(23) (1994) - 1993
- [b1]Petr Hájek, Pavel Pudlák:
Metamathematics of First-Order Arithmetic. Perspectives in mathematical logic, Springer 1993, ISBN 978-3-540-63648-9, pp. I-XIV, 1-460 - [j15]András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán:
Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci. 46(2): 129-154 (1993) - [j14]Pavel Pudlák, Petr Savický:
On shifting networks. Theor. Comput. Sci. 116(2): 415-419 (1993) - [c14]Pavel Pudlák:
AC0 Circuit Complexity. FCT 1993: 106-120 - [c13]Johan Håstad, Stasys Jukna, Pavel Pudlák:
Top-Down Lower Bounds for Depth 3 Circuits. FOCS 1993: 124-129 - [c12]Pavel Pudlák, Vojtech Rödl:
Modified ranks of tensors and the size of circuits. STOC 1993: 523-531 - 1992
- [j13]Pavel Pudlák, Vojtech Rödl:
A combinatorial approach to complexity. Comb. 12(2): 221-226 (1992) - [c11]Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods:
Exponential Lower Bounds for the Pigeonhole Principle. STOC 1992: 200-220 - 1991
- [j12]Jan Krajícek, Pavel Pudlák, Gaisi Takeuti:
Bounded Arithmetic and the Polynomial Hierarchy. Ann. Pure Appl. Log. 52(1-2): 143-153 (1991) - 1990
- [j11]Jan Krajícek, Pavel Pudlák:
Quantified propositional calculi and fragments of bounded arithmetic. Math. Log. Q. 36(1): 29-46 (1990) - [j10]