default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorg Kreisel
Person information
- affiliation: Stanford University, Stanford, CA, USA
- affiliation: Université de Paris, Paris, France
- affiliation: University of Reading, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j17]Georg Kreisel:
Second Thoughts Around Some of Gödel's Writings. Synth. 114(1): 99-160 (1998)- 1992
- [j16]Georg Kreisel:
On the Idea(l) of Logical Closure. Ann. Pure Appl. Log. 56(1-3): 19-41 (1992)
1980 – 1989
- 1988
- [j15]Georg Kreisel:
Book review: Collected works, Vol. I [Oxford Univ. Press, New York, 1986] by K. Gödel. Notre Dame J. Formal Log. 29(1): 160-181 (1988) - 1987
- [j14]Georg Kreisel:
Church's thesis and the ideal of informal rigour. Notre Dame J. Formal Log. 28(4): 499-519 (1987) - 1985
- [c1]Georg Kreisel:
Proof Theory and the Synthesis of Programs: Potential and Limitations. European Conference on Computer Algebra (1) 1985: 136-150
1970 – 1979
- 1972
- [j13]Georg Kreisel:
Which Number Theoretic Problems can be Solved in Recursive Progressions on O 1/1 -Paths Through O? J. Symb. Log. 37(2): 311-334 (1972)
1960 – 1969
- 1968
- [j12]Georg Kreisel:
A Survey of Proof Theory. J. Symb. Log. 33(3): 321-388 (1968) - 1966
- [j11]William A. Howard, Georg Kreisel:
Transfinite Induction and Bar Induction of Types Zero and One, and the Role of Continuity in Intuitionistic Analysis. J. Symb. Log. 31(3): 325-358 (1966) - 1965
- [j10]Georg Kreisel, Gerald E. Sacks:
Metarecursive Sets. J. Symb. Log. 30(3): 318-338 (1965) - 1962
- [j9]Georg Kreisel:
On Weak Completeness of Intuitionistic Predicate Logic. J. Symb. Log. 27(2): 139-158 (1962)
1950 – 1959
- 1958
- [j8]Georg Kreisel:
Mathematical Significance of Consistency Proofs. J. Symb. Log. 23(2): 155-182 (1958) - [j7]Georg Kreisel:
Elementary Completeness Properties of Intuitionistic Logic With a Note on Negations of Prenex Formulae. J. Symb. Log. 23(3): 317-330 (1958) - [j6]Georg Kreisel:
A Remark on Free Choice Sequences and the Topological Completeness Proofs. J. Symb. Log. 23(4): 369-388 (1958) - 1957
- [j5]Georg Kreisel, Hilary Putnam:
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül. Arch. Math. Log. 3(3-4): 74-78 (1957) - 1954
- [j4]Georg Kreisel:
Remark on complete interpretations by models. Arch. Math. Log. 2(1): 4-9 (1954) - 1952
- [j3]Georg Kreisel:
On the Interpretation of Non-Finitist Proofs: Part II. Interpretation of Number Theory. Applications. J. Symb. Log. 17(1): 43-58 (1952) - [j2]Heinrich Scholz, Georg Kreisel, Leon Henkin:
Problems. J. Symb. Log. 17(2): 160 (1952) - 1951
- [j1]Georg Kreisel:
On the Interpretation of Non-Finitist Proofs - Part I. J. Symb. Log. 16(4): 241-267 (1951)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
