Journal of Symbolic Logic

Complexity, decidability and completeness

Douglas Cenzer and Jeffrey B. Remmel

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory has an exponential time (EXPTIME) complete consistent extension whereas there is a nondeterministic polynomial time (NP) decidable theory which has no polynomial time complete consistent extension when length is measured relative to the binary representation of natural numbers and formulas. It is well known that a propositional theory is axiomatizable (respectively decidable) if and only if it may be represented as the set of infinite paths through a computable tree (respectively a computable tree with no dead ends). We show that any polynomial time decidable theory may be represented as the set of paths through a polynomial time decidable tree. On the other hand, the statement that every polynomial time decidable tree represents the set of complete consistent extensions of some theory which is polynomial time decidable, relative to the tally representation of natural numbers and formulas, is equivalent to P=NP. For predicate logic, we develop a complexity theoretic version of the Henkin construction to prove a complexity theoretic version of the Completeness Theorem. Our results imply that that any polynomial space decidable theory Δ possesses a polynomial space computable model which is exponential space decidable and thus Δ has an exponential space complete consistent extension. Similar results are obtained for other notions of complexity.

Article information

Source
J. Symbolic Logic Volume 71, Issue 2 (2006), 399-424.

Dates
First available: 2 May 2006

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1146620150

Digital Object Identifier
doi:10.2178/jsl/1146620150

Mathematical Reviews number (MathSciNet)
MR2225885

Zentralblatt MATH identifier
1118.03029

Citation

Cenzer, Douglas; Remmel, Jeffrey B. Complexity, decidability and completeness. Journal of Symbolic Logic 71 (2006), no. 2, 399--424. doi:10.2178/jsl/1146620150. http://projecteuclid.org/euclid.jsl/1146620150.


Export citation

References

  • R. Brent, Fast multiple-precision evaluation of elementary functions, Journal of the ACM, vol. 23 (1976), pp. 242--251.
  • D. Cenzer, R. Downey, and J. B. Remmel, Feasible torsion-free Abelian groups,To appear.
  • D. Cenzer and J. B. Remmel, Feasible graphs with standard universe, Computability theory, Oberwolfach 1996, Special issue of Annals of Pure and Applied Logic, vol. 94 (1998), pp. 21--35.
  • --------, Polynomial-time versus recursive models, Annals of Pure and Applied Logic, vol. 54 (1991), pp. 17--58.
  • --------, Polynomial-time Abelian groups, Annals of Pure and Applied Logic, vol. 56 (1992), pp. 313--363.
  • --------, Recursively presented games and strategies, Mathematical Social Sciences, vol. 24 (1992), pp. 117--139.
  • --------, Feasible graphs and colorings, Mathematical Logic Quarterly, vol. 41 (1995), pp. 327--352.
  • --------, Feasibly categorical abelian groups, Feasible mathematics II (P. Clote and J. Remmel, editors), Progess in Computer Science and Applied Logic, vol. 13, Birkhäuser, 1995, pp. 91--154.
  • --------, Feasibly categorical models, Logic and computational complexity (D. Leivant, editor), Lecture Notes in Computer Science, vol. 960, Springer-Verlag, 1995, pp. 300--312.
  • --------, Complexity-theoretic model theory and algebra, Handbook of recursive mathematics, Vol. 1: Recursive model theory (Y. Ersov, S. Goncharov, V. Marek, A. Nerode, and J. Remmel, editors), Elsevier Studies in Logic and the Foundations of Mathematics, vol. 138, 1998, pp. 381--513.
  • --------, $\Pi^0_1$ classes, Handbook of recursive mathematics, Vol. 2: Recursive algebra, analysis and combinatorics (Y. Ersov, S. Goncharov, V. Marek, A. Nerode, and J. Remmel, editors), Elsevier Studies in Logic and the Foundations of Mathematics, vol. 139, 1998, pp. 623--821.
  • H. Ebbinghaus and J. Flum, Finite model theory, Perspectives in Mathematical Logic, Springer-Verlag, 1995.
  • A. Ehrenfeucht, Separable theories, Bulletin de l'Academie Polonaise des Sciences. Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 9 (1961), pp. 17--19.
  • J. Ferrante and C. Rackoff, Complexity of logical theories, Lecture Notes in Mathematics, vol. 718, Springer-Verlag, 1979.
  • S. Grigorieff, Every recursive linear ordering has a copy in $\textitDTIME(n)$, Journal of Symbolic Logic, vol. 55 (1990), pp. 260--276.
  • V. Harizanov, Pure computable model theory, Handbook of recursive mathematics (Yu. Ershov et al., editors), vol. 1, Elsevier, 1998, pp. 3--114.
  • J. Hopcroft and J. Ullman, Formal languages and their relations to automata, Addison Wesley, 1969.
  • C. G. Jockusch and R. I. Soare, $\Pi^0_1$ classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33--56.
  • Ker-I Ko, Complexity theory of real functions, Progress in Theoretical Computer Science, Birkhäuser, 1991.
  • A. Nerode and J. B. Remmel, Complexity theoretic algebra I, vector spaces over finite fields, Proceedings of structure in complexity, second annual conference, IEEE Computer Society, 1987, pp. 218--239.
  • --------, Complexity theoretic algebra II, the free Boolean algebra, Annals of Pure and Applied Logic, vol. 44 (1989), pp. 71--99.
  • --------, Complexity theoretic algebra: vector space bases, Feasible mathematics (S. Buss and P. Scott, editors), Progress in Computer Science and Applied Logic, vol. 9, Birkhäuser, 1990, pp. 293--319.
  • P. Odifreddi, Classical recursion theory, North--Holland, Amsterdam, 1989.
  • C. Papadimitriou, Computational complexity, Addison-Wesley, 1994.
  • J. B. Remmel, When is every recursive linear ordering of type $\mu$ recursively isomorphic to a p-time linear order over the binary representation of the natural numbers?, Feasible mathematics (S. Buss and P. Scott, editors), Progress in Computer Science and Applied Logic, vol. 9, Birkhäuser, 1990, pp. 321--341.
  • --------, Polynomial-time categoricity and linear orderings, Logical methods (J. Crossley, J. Remmel, R. Shore, and M. Sweedler, editors), Progress in Computer Science and Applied Logic, vol. 12, Birkhäuser, 1993, pp. 321--341.
  • J. R. Shoenfield, Degrees of models, Journal of Symbolic Logic, vol. 25 (1960), pp. 233--237.
  • R. Soare, Recursively enumerable sets and degrees, Springer-Verlag, Berlin, 1987.