Skip to content

Opening book details…

About this Computer Science article

Stephen G. Simpson. Nonprovability of certain combinatorial properties of finite trees. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 87–117. (English translation of Nichtbeweisbarkeit von… by Buchholz, W. is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Buchholz, W.
Publisher
Association for Symbolic Logic; Cambridge University Press; Cambridge University Press (CUP) (ISSN 0022-4812)
Published
1990
Field
Computer Science (Physical Sciences)

More by Buchholz, W.

Browse all works by Buchholz, W.