Abstract
Let H be a proof system for quantified propositional calculus (QPC). We define the Σq j -witnessing problem for H to be: given a prenex Σq j -formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σq 1 -witnessing problems for the systems G* 1 and G1 are complete for polynomial time and PLS (polynomial local search), respectively.
We introduce and study the systems G* 0 and G0, in which cuts are restricted to quantifier-free formulas, and prove that the Σq j -witnessing problem for each is complete for NC1. Our proof involves proving a polynomial time version of Gentzen’s midsequent theorem for G* 0 and proving that G0-proofs are TC0-recognizable. We also introduce QPC systems for TC0 and prove witnessing theorems for them.
We introduce a finitely axiomatizable second-order system VNC1 of bounded arithmetic which we prove isomorphic to Arai’s first order theory AID + Σb 0 -CA for uniform NC1. We describe simple translations of VNC1 proofs of all bounded theorems to polynomial size families of G* 0 proofs. From this and the above theorem we get alternative proofs of the NC1 witnessing theorems for VNC1 and AID.
Similar content being viewed by others
References
Arai, T.: A bounded arithmetic AID for Frege systems. Ann. Pure Appl. Logic 103, 155–199 (2000)
Barrington, D.A.M., Immerman, N., Straubing, H.: On Uniformity within NC1. J. Comput. Syst. Sci. 41, 274–306 (1990)
Buss, : Bounded Arithmetic. Bibliopolis, 1986
Buss, : The Boolean formula value problem is in ALOGTIME. Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC’87). 1987, pp. 123–131
Buss, S.: Axiomatizations and conservation results for fragments of bounded arithmetic. In: Logic and Computation, Proceedings of a Workshop held at Carnegie Mellon University. AMS, 1990, pp. 57–84
Buss, S.: Propositional consistency proofs. Ann. Pure Appl. Logic 52, 3–29 (1991)
Buss, S.: Algorithms for Boolean formula evaluation and for tree-contraction. In: P. Clote, J. Krajicek (eds.), Proof Theory, Complexity, and Arithmetic. Oxford University Press, 1993, pp. 95–115
Buss, S.: First-order proof theory of arithmetic. In: S. Buss (ed.), Handbook of Proof Theory. Elsevier, 1998, pp. 79–147. Available on line at http://www.math.ucsd.edu/~sbuss/ResearchWeb/
Buss, : An introduction to proof theory. In: S. Buss (ed.), Handbook of Proof Theory. Elsevier, 1998, pp. 1–78. Available on line at http://www.math.ucsd.edu/~sbuss/ResearchWeb/
Buss, S.: 2003. Personnal communication
Buss, S., Clote, P.: Cutting planes, connectivity, and threshold logic. Arch. Math. Logic 35, 33–62 (1996)
Buss, S., Krajicek, J.: An application of Boolean complexity to separation problems in bounded arithmetic. The Proceedings of the London Mathematical Society 60 (3), 1–21 (1994)
Chiari, M., Krajicek, J.: Witnessing functions in bounded arithmetic and search problems. The J. Symbolic Logic 63, 1095–1115 (1998)
Clote, P.: ALOGTIME and a conjecture of S.A. Cook. Ann. Math. Art. Intell. 6, 57–106 (1990). Extended abstract in Proc. 13th IEEE Symposium on Logic in Computer Science, 1990
Clote, P. Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME,ACk,NCk and NC. In: S. Buss, P. Scott (eds), Feasible Mathematics. Birkhauser, 1990, pp. 49–69
Cook, S.: Csc 2429 course notes: Proof complexity and bounded arithmetic, 2002. Available from the web at http://www.cs.toronto.edu/~sacook/csc2429h/+
Cook, : Theories for complexity classes and their propositional translations. In: J. Krajicek (ed.), Complexity of Computations and Proofs. Quaderni di Matematica, 2003, pp. 175–227
Cook, S., Kolokolova, A.: A second-order system for polytime reasoning based on Grädel’s theorem. Ann. Pure Appl. Logic 124, 193–231 (2003)
Cook, S., Thapen, N.: The strength of replacement in weak arithmetic. ACM Transactions on Computational Logic. 2005, pp. 1–16 (in Press)
Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symbolic Logic 44 (1), 36–50 (1977)
Immerman, N.: Descriptive Complexity. Springer, 1999
Johnson, D.S.: A catalog of complexity classes. In: J. van Leewen (ed.), Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990, pp. 67–161
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37, 79–100 (1988)
Krajíček, J.: Exponentiation and second-order bounded arithmetic. Ann. Pure Appl. Logic 48, 261–276 (1990)
Krajicek, J.: Fragments of Bounded Arithmetic and Bounded Query Classes. Transactions of the American Mathematical Society 338 (2), 587–598 (1993)
Krajíček, J.: Bounded Arithmetic, Propositional Logic and Computational Complexity. Cambridge University Press, 1995
Krajíček, J., Pudlák, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f. Mathematische Logik u. Grundlagen d. Mathematik 36, 29–46 (1990)
Morioka, : Logical approaches to the complexity of search problems: Proof complexity, quantified propositional calculus, and bounded arithmetic. PhD thesis, Department of Computer Science, University of Toronto, 2005
Nguyen, P.: Proving that VNC1 is finitely axiomatizable. unpublished note, 2004
Pitassi, T.: Using hardness to prove Frege lower bounds, 2002. A seminar at the Fields Institute for Research in Mathematical Sciences, Toronto, Canada
Pollett, C.: A propositional proof systems for Ri2. In: P. Beame, S. Buss (eds.), Proof Complexity and Feasible Arithmetics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, The American Mathematical Society, 1997, pp. 253–278
Pollett, C.: Structure and Definability in General Bounded Arithmetic Theories. Ann. Pure Appl. Logic 100, 189–245 (1999)
Razborov, A.A.: An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic. In: P. Clote, J. Krajicek (eds.), Arithmetic, Proof Theory and Computational Complexity. Oxford University Press, 1993, pp. 247–77
Skelley, A.: Personal communication., 2002
Takeuti, G.: Proof Theory. Elsevier Science Publisers, second edition, 1987
Takeuti, G.: RSUV isomorphism. In: P. Clote, J. Krajicek (eds.), Arithmetic, Proof Theory and Computational Complexity. Oxford University Press, 1993, pp. 364–86
Zambella, D.: Notes on polynomially bounded arithmetic. J. Symbolic Logic 61 (3), 942–966 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was carried while this author was a student at the University of Toronto.
Rights and permissions
About this article
Cite this article
Cook, S., Morioka, T. Quantified propositional calculus and a second-order theory for NC1. Arch. Math. Logic 44, 711–749 (2005). https://doi.org/10.1007/s00153-005-0282-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-005-0282-2