-
1
-
-
0000978928
-
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
-
Craig, W. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22 (1955).
-
(1955)
J. Symbolic Logic
, vol.22
-
-
Craig, W.1
-
2
-
-
0018020102
-
Assignment commands with array references
-
Oct.
-
Downey, P.J., AND Sethi, R. Assignment commands with array references. J. ACM 25, 4 (Oct. 1978), 652-666.
-
(1978)
J. ACM
, vol.4
, pp. 652-666
-
-
Downey, P.J.1
Sethi, R.2
-
3
-
-
84976863127
-
Variations on the common subexpression problem
-
To appear
-
Downey, P., Sethi, R., AND Tarjan, R. Variations on the common subexpression problem. To appear in J. ACM.
-
J. ACM.
-
-
Downey, P.1
Sethi, R.2
Tarjan, R.3
-
4
-
-
0004018546
-
Some completeness results in the mathematical theory of computation
-
Jan.
-
Kaplan, D.M. Some completeness results in the mathematical theory of computation. J. ACM 15, 1 (Jan. 1968), 124-134.
-
(1968)
J. ACM
, vol.15
, Issue.1
, pp. 124-134
-
-
Kaplan, D.M.1
-
5
-
-
84915726982
-
Diophantine representation of recursively enumerable predicates
-
North-Holland Publ. Co.
-
Matiyasevich, Y.V. Diophantine representation of recursively enumerable predicates. Proc. 2nd Scandinavian Logic Symposium, North-Holland Publ. Co., 1970.
-
(1970)
Proc. 2nd Scandinavian Logic Symposium
-
-
Matiyasevich, Y.V.1
-
6
-
-
0002699574
-
A basis for a mathematical theory of computation
-
P. Braffort and D. Hirshberg, Eds. North-Holland Publ. Co.
-
McCarthy, J. A basis for a mathematical theory of computation. In Computing Programming and Formal Systems, P. Braffort and D. Hirshberg, Eds. North-Holland Publ. Co., 1963.
-
(1963)
Computing Programming and Formal Systems
-
-
McCarthy, J.1
-
7
-
-
70350664395
-
Fast decision algorithms based on congruence closure
-
STAN-CS-77-646, Stanford U.
-
Nelson, C.G., and Oppen, D.C. Fast decision algorithms based on congruence closure. CS Rep. STAN-CS-77-646, Stanford U., 1978.
-
(1978)
CS Rep.
-
-
Nelson, C.G.1
Oppen, D.C.2
-
8
-
-
84976732417
-
Convexity, complexity, and combinations of theories
-
To appear
-
Oppen, D.C. Convexity, complexity, and combinations of theories. To appear in Theoretical Comptr. Sci.
-
Theoretical Comptr. Sci.
-
-
Oppen, D.C.1
-
9
-
-
84976793283
-
Reasoning about recursively defined data structures
-
Schoenfield, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass.
-
Oppen, D.C. Reasoning about recursively defined data structures. To appear in J. ACM. Schoenfield, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967.
-
(1967)
J. ACM
-
-
Oppen, D.C.1
-
10
-
-
0018454851
-
An practical decision procedure for arithmetic with function symbols
-
April
-
Shostak, R.E. An practical decision procedure for arithmetic with function symbols. J. ACM 26, 2 (April 1979), 351-360.
-
(1979)
J. ACM
, vol.26
, Issue.2
, pp. 351-360
-
-
Shostak, R.E.1
-
12
-
-
0003431753
-
A decision method for elementary algebra and geometry
-
Berkeley
-
Tarski, A. A decision method for elementary algebra and geometry. Berkeley, 1951.
-
(1951)
-
-
Tarski, A.1
|