The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

G. Kreisel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. G. Kreisel
    On the Idea(l) of Logical Closure. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:19-41 [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. G. Kreisel
    Mathematical Significance of Consistency Proofs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1958, v:23, n:2, pp:155-182 [Journal]
  7. 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]
  8. 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]
  9. 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]
  10. G. Kreisel
    A Survey of Proof Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1968, v:33, n:3, pp:321-388 [Journal]
  11. 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]
  12. G. Kreisel, Gerald E. Sacks
    Metarecursive Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1965, v:30, n:3, pp:318-338 [Journal]
  13. Heinrich Scholz, G. Kreisel, Leon Henkin
    Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1952, v:17, n:2, pp:160- [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002