G. Kreisel Proof Theory and the Synthesis of Programs: Potential and Limitations. [Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (1), 1985, pp:136-150 [Conf]
W. A. Howard, G. Kreisel Transfinite Induction and Bar Induction of Types Zero and One, and the Role of Continuity in Intuitionistic Analysis. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1966, v:31, n:3, pp:325-358 [Journal]
G. Kreisel On the Interpretation of Non-Finitist Proofs - Part I. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1951, v:16, n:4, pp:241-267 [Journal]
G. Kreisel On the Interpretation of Non-Finitist Proofs: Part II. Interpretation of Number Theory. Applications. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1952, v:17, n:1, pp:43-58 [Journal]
G. Kreisel Mathematical Significance of Consistency Proofs. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1958, v:23, n:2, pp:155-182 [Journal]
G. Kreisel Elementary Completeness Properties of Intuitionistic Logic With a Note on Negations of Prenex Formulae. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1958, v:23, n:3, pp:317-330 [Journal]
G. Kreisel A Remark on Free Choice Sequences and the Topological Completeness Proofs. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1958, v:23, n:4, pp:369-388 [Journal]
G. Kreisel On Weak Completeness of Intuitionistic Predicate Logic. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1962, v:27, n:2, pp:139-158 [Journal]
G. Kreisel Which Number Theoretic Problems can be Solved in Recursive Progressions on O 1/1 -Paths Through O? [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1972, v:37, n:2, pp:311-334 [Journal]