Computational logic

edited by Ulrich Berger, Helmut Schwichtenberg

Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field. Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).

「Nielsen BookData」より

[目次]

  • Game Semantics.- Notes on the Simply Typed Lambda Calculus.- Problems in Type Theory.- Formal Correctness Proofs of Functional Programs: Dijkstra's Algorithm, a Case Study.- Propositional Proof Complexity - An Introduction.- Formalizing Decidability Theorems About Automata.- On the Meaning of Logical Rules I: Syntax Versus Semantics.- Complexity of Primitive Recursion.- Computers, Reasoning and Mathematical Practice.- Research Directions in Rewriting Logic.- Sequent Calculus and the Specification of Computation.

「Nielsen BookData」より

この本の情報

書名 Computational logic
著作者等 Berger, Ulrich
North Atlantic Treaty Organization. Scientific Affairs Division
Schwichtenberg, Helmut
シリーズ名 NATO ASI series
出版元 Springer
刊行年月 c1999
ページ数 444 p.
大きさ 25 cm
ISBN 3540645896
NCID BA4108308X
※クリックでCiNii Booksを表示
言語 英語
出版国 アメリカ合衆国
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想