Basic proof theory

A.S. Troelstra, H. Schwichtenberg

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.

「Nielsen BookData」より

[目次]

  • 1. Introduction
  • 2. N-systems and H-systems
  • 3. Gentzen systems
  • 4. Cut elimination with applications
  • 5. Bounds and permutations
  • 6. Normalization for natural deduction
  • 7. Resolution
  • 8. Categorical logic
  • 9. Modal and linear logic
  • 10. Proof theory of arithmetic
  • 11. Second-order logic
  • Solutions to selected exercises. Bibliography
  • Symbols and notation
  • Index.

「Nielsen BookData」より

この本の情報

書名 Basic proof theory
著作者等 Schwichtenberg, Helmut
Troelstra, A. S.
Abramsky S.
Aczel P.H.
Bakker J. W. de
Gurevich Y.
Tucker J.V.
Van Rijsbergen C. J.
Troelstra A. S.
シリーズ名 Cambridge tracts in theoretical computer science
出版元 Cambridge University Press
刊行年月 2000
版表示 2nd ed
ページ数 xii, 417 p.
大きさ 23 cm
ISBN 0521779111
NCID BA47606340
※クリックでCiNii Booksを表示
言語 英語
出版国 イギリス
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想