Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Georg Kreisel

> Home > Persons

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

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

1998
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/synthese/Kreisel98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/synthese/Kreisel98
Georg Kreisel:
Second Thoughts Around Some of Gödel's Writings. Synth. 114(1): 99-160 (1998)
1992
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/apal/Kreisel92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/Kreisel92
Georg Kreisel:
On the Idea(l) of Logical Closure. Ann. Pure Appl. Log. 56(1-3): 19-41 (1992)
1988
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/ndjfl/Kreisel88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ndjfl/Kreisel88
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]
- view
  authority control:
- export record
  dblp key:
  - journals/ndjfl/Kreisel87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ndjfl/Kreisel87
Georg Kreisel:
Church's thesis and the ideal of informal rigour. Notre Dame J. Formal Log. 28(4): 499-519 (1987)
1972
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel72
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)
1968
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel68
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel68
Georg Kreisel:
A Survey of Proof Theory. J. Symb. Log. 33(3): 321-388 (1968)
1966
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/HowardK66
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/HowardK66
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]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/KreiselS65
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/KreiselS65
Georg Kreisel, Gerald E. Sacks:
Metarecursive Sets. J. Symb. Log. 30(3): 318-338 (1965)
1962
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel62
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel62
Georg Kreisel:
On Weak Completeness of Intuitionistic Predicate Logic. J. Symb. Log. 27(2): 139-158 (1962)
1958
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel58
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel58
Georg Kreisel:
Mathematical Significance of Consistency Proofs. J. Symb. Log. 23(2): 155-182 (1958)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel58a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel58a
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]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel58b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel58b
Georg Kreisel:
A Remark on Free Choice Sequences and the Topological Completeness Proofs. J. Symb. Log. 23(4): 369-388 (1958)
1957
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/aml/KreiselP57
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/KreiselP57
Georg Kreisel, Hilary Putnam:
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül. Arch. Math. Log. 3(3-4): 74-78 (1957)
1954
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/aml/Kreisel54
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/Kreisel54
Georg Kreisel:
Remark on complete interpretations by models. Arch. Math. Log. 2(1): 4-9 (1954)
1952
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel52
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel52
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]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/ScholzKH52
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/ScholzKH52
Heinrich Scholz, Georg Kreisel, Leon Henkin:
Problems. J. Symb. Log. 17(2): 160 (1952)
1951
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/Kreisel51
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/Kreisel51
Georg Kreisel:
On the Interpretation of Non-Finitist Proofs - Part I. J. Symb. Log. 16(4): 241-267 (1951)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

1985
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/eurocal/Kreisel85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocal/Kreisel85
Georg Kreisel:
Proof Theory and the Synthesis of Programs: Potential and Limitations. European Conference on Computer Algebra (1) 1985: 136-150

a service of

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.