Concepedia
Annals of Pure and Applied Logic · 1990 · 18 citations · 9 references
EducationMathematicsMathematics EducationTheory Of ComputationArithmetic FunctionsNumber SenseNumeracy DevelopmentCognitive Foundations Of Arithmetic
9
On the computational complexity of algorithms
Juris Hartmanis, Richard E. Stearns · Transactions of the American Mathematical Society · 1965 · 957 citations · Full text
Computing, Computer Science, Mathematics +15
Relational queries computable in polynomial time
Neil Immerman · Information and Control · 1986 · 648 citations
Computing, Computer Science, Mathematics +14
Classification theory and the number of non-isomorphic models
Journal of Pure and Applied Algebra · 1991 · 619 citations
Natural Sciences, Mathematics, Combinatorics +4
An application of games to the completeness problem for formalized theories
Andrzej Ehrenfeucht · Fundamenta Mathematicae · 1961 · 613 citations · Full text
Upper and lower bounds for first order expressibility
Neil Immerman · Journal of Computer and System Sciences · 1982 · 257 citations
Computing, Computer Science, Mathematics +6