Advances in proof theory
著者
書誌事項
Advances in proof theory
(Progress in computer science and applied logic, v. 28)
Birkhäuser , Springer, c2016
大学図書館所蔵 全9件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas. Some emphasis will be put on ordinal analysis, reductive proof theory, explicit mathematics and type-theoretic formalisms, and abstract computations. The volume is dedicated to the 60th birthday of Professor Gerhard Jager, who has been instrumental in shaping and promoting logic in Switzerland for the last 25 years. It comprises contributions from the symposium "Advances in Proof Theory", which was held in Bern in December 2013.
Proof theory came into being in the twenties of the last century, when it was inaugurated by David Hilbert in order to secure the foundations of mathematics. It was substantially influenced by Goedel's famous incompleteness theorems of 1930 and Gentzen's new consistency proof for the axiom system of first order number theory in 1936. Today, proof theory is a well-established branch of mathematical and philosophical logic and one of the pillars of the foundations of mathematics. Proof theory explores constructive and computational aspects of mathematical reasoning; it is particularly suitable for dealing with various questions in computer science.
目次
W. Buchholz: A survey on ordinal notations around the Bachmann-Howard ordinal.- A. Cantini: About truth and types.- R. Dyckhoff: Intuitionistic decision procedures since Gentzen.- S. Feferman: The operational perspective.- R. Gore: Formally verified proof-theory using Isabelle/HOL.- P. Minari: Analytic equational proof systems for combinatory logic and lambda calculus.- W. Pohlers: From subsystems of classical analysis to subsystems of set theory - a personal account.- M. Rathjen: Ordinal analysis and witness extraction.- P. Schuster: Logic completeness via open induction.- H. Schwichtenberg: On the computational content of Higman's lemma.- P. Schroeder-Heister: TBA.- A. Setzer: TBA.- S. Wainer: On weak "pointwise" induction, and a miniaturized predicativity.
「Nielsen BookData」 より