Switch to: Citations

References in:

Classifying the computational complexity of problems

Larry Stockmeyer

Journal of Symbolic Logic 52 (1):1-43 (1987)

Add references

You must login to add references.

Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.details Logic and Philosophy of Logic Direct download Export citation Bookmark 64 citations
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.details Logic and Philosophy of Logic Direct download Export citation Bookmark 71 citations
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details Logic and Philosophy of Logic Direct download Export citation Bookmark 594 citations
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.details Logic and Philosophy of Logic Direct download Export citation Bookmark 223 citations
Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.details Areas of Mathematics, Misc in Philosophy of Mathematics Direct download (2 more) Export citation Bookmark 58 citations
Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität.Günter Asser - 1955 - Mathematical Logic Quarterly 1 (4):252-263.details German Philosophy in European Philosophy Direct download Export citation Bookmark 14 citations
Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität.Günter Asser - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):252-263.details No categories Direct download Export citation Bookmark 11 citations

1