Model theoretic aspects of computational complexity

[1]  Celia Wrathall,et al.  Rudimentary Predicates and Relative Computation , 1978, SIAM J. Comput..

[2]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Claus-Peter Schnorr,et al.  A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors , 1977, Inf. Process. Lett..

[4]  R. Tarjan.  Complexity of combinatorial algorithms , 1977 .

[5]  Leonard Berman,et al.  On the structure of complete sets: Almost everywhere complexity and infinitely often speedup , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[6]  J. Hopcroft,et al.  Independence results in computer science , 1976, SIGA.

[7]  Joram Hirschfeld,et al.  Forcing, Arithmetic, Division Rings , 1975 .

[8]  Nancy A. Lynch,et al.  On Reducibility to Complex or Sparse Sets , 1975, JACM.

[9]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[10]  Zvi Galil,et al.  On the Complexity of Resolution Procedures for Theorem Proving , 1974 .

[11]  Manuel Blum,et al.  On Almost Everywhere Complex Recursive Functions , 1974, JACM.

[12]  S. Cook,et al.  On the lengths of proofs in the propositional calculus (Preliminary Version) , 1974, STOC '74.

[13]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[14]  Robert L. Constable,et al.  A Constructive Theory of Recursive Functions , 1973 .

[15]  Edward L. Robertson,et al.  Recursive Properties of Abstract Complexity Classes , 1972, J. ACM.

[16]  Patrick C. Fischer,et al.  Computational speed-up by effective operators , 1972, Journal of Symbolic Logic.

[17]  Rohit Parikh,et al.  Existence and feasibility in arithmetic , 1971, Journal of Symbolic Logic.

[18]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[19]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[20]  Harold Simmons,et al.  Existentially Closed Models of Basic Number Theory , 1977 .

[21]  David Galer Kirkpatrick,et al.  Topics in the complexity of combinatorial algorithms. , 1974 .

[22]  Haim Gaifman,et al.  A note on models and submodels of arithmetic , 1972 .

[23]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[24]  M. Rabin.  Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .

[25]  T. Skolem.  Über die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abzählbar unendlich vieler Aussagen mit ausschliesslich Zahlenvariablen , 1934 .