REVIEWS-Basic proof theory

, &
Bulletin of Symbolic Logic 7 (2):280 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,237

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Basic proof theory, A.S. Troelstra and H. Schwichtenberg.Harold Schellinx - 1998 - Journal of Logic, Language and Information 7 (2):221-223.
A. S. Troelstra and H. Schwichtenberg. Basic proof theory. Second edition of jsl lxiii 1605. Cambridge tracts in theoretical computer science, no. 43. cambridge university press, cambridge, new York, etc., 2000, XII + 417 pp. [REVIEW]Roy Dyckhoff - 2001 - Bulletin of Symbolic Logic 7 (2):280-280.
A. S. Troelstra and H. Schwichtenberg. Basic proof theory. Cambridge tracts in theoretical computer science, no. 43. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, xi + 343 pp. [REVIEW]Roy Dyckhoff - 1998 - Journal of Symbolic Logic 63 (4):1605-1606.
A. S. Troelstra. Realizability. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 407–473. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):470-471.
REVIEWS-A first course in logic: An introduction to model theory, proof theory, computability, and complexity.S. Hedman & Alasdair Urquhart - 2007 - Bulletin of Symbolic Logic 13 (4):538-539.
Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp.Smoryński C.. D.1. The incompleteness theorems. Pp. 821–865.Schwichtenberg Helmut. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895.Statman Richard. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912.Feferman Solomon. D.4. Theories of finite type related to mathematical practice. Pp. 913–971.Troelstra A. S.. D.5. Aspects of constructive mathematics. Pp. 973–1052.Fourman Michael P.. D.6. The logic of topoi. Pp. 1053–1090.Barendregt Henk P.. D.1. The type free lambda calculus. Pp. 1091–1132.Paris Jeff and Harrington Leo. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
A new basic set of proof transformations.Anjolina G. de Oliveira & Rjgb de Queiroz - 1997 - Bulletin of Symbolic Logic 3 (1):124-126.
In memoriam: Anne sjerp Troelstra 1939–2019.Dick de Jongh & Joan Rand Moschovakis - 2020 - Bulletin of Symbolic Logic 26 (3-4):293-295.
Helmut Schwichtenberg. Finite notations for infinite terms. Annals of pure and applied logic, vol. 94 , pp. 201–222. [REVIEW]Herman Ruge Jervell - 2000 - Bulletin of Symbolic Logic 6 (4):477-477.
Reductive Logic And Proof-search—proof Theory, Semantics, And Control. [REVIEW]Didier Galmiche - 2006 - Bulletin of Symbolic Logic 12 (2):302-303.

Analytics

Added to PP
2014-03-25

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Anne Troelstra
Last affiliation: University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references