語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Advances in proof theory[electronic ...
~
Kahle, Reinhard.
Advances in proof theory[electronic resource] /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
杜威分類號:
511.36
書名/作者:
Advances in proof theory/ edited by Reinhard Kahle, Thomas Strahm, Thomas Studer.
其他作者:
Kahle, Reinhard.
出版者:
Cham : : Springer International Publishing :, 2016.
面頁冊數:
xii, 425 p. : : ill., digital ;; 24 cm.
Contained By:
Springer eBooks
標題:
Proof theory
標題:
Mathematics.
標題:
Mathematical Logic and Foundations.
標題:
Logic.
ISBN:
9783319291987
ISBN:
9783319291963
內容註:
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.
摘要、提要註:
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 Godel'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.
電子資源:
http://dx.doi.org/10.1007/978-3-319-29198-7
Advances in proof theory[electronic resource] /
Advances in proof theory
[electronic resource] /edited by Reinhard Kahle, Thomas Strahm, Thomas Studer. - Cham :Springer International Publishing :2016. - xii, 425 p. :ill., digital ;24 cm. - Progress in computer science and applied logic,v.282297-0576 ;. - Progress in computer science and applied logic ;v.26..
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.
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 Godel'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.
ISBN: 9783319291987
Standard No.: 10.1007/978-3-319-29198-7doiSubjects--Topical Terms:
199981
Proof theory
LC Class. No.: QA9.54
Dewey Class. No.: 511.36
Advances in proof theory[electronic resource] /
LDR
:03120nam a2200337 a 4500
001
450765
003
DE-He213
005
20161101170739.0
006
m d
007
cr nn 008maaau
008
161210s2016 gw s 0 eng d
020
$a
9783319291987
$q
(electronic bk.)
020
$a
9783319291963
$q
(paper)
024
7
$a
10.1007/978-3-319-29198-7
$2
doi
035
$a
978-3-319-29198-7
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA9.54
072
7
$a
PBC
$2
bicssc
072
7
$a
PBCD
$2
bicssc
072
7
$a
MAT018000
$2
bisacsh
082
0 4
$a
511.36
$2
23
090
$a
QA9.54
$b
.A244 2016
245
0 0
$a
Advances in proof theory
$h
[electronic resource] /
$c
edited by Reinhard Kahle, Thomas Strahm, Thomas Studer.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Birkhauser,
$c
2016.
300
$a
xii, 425 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Progress in computer science and applied logic,
$x
2297-0576 ;
$v
v.28
505
0
$a
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.
520
$a
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 Godel'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.
650
0
$a
Proof theory
$3
199981
650
1 4
$a
Mathematics.
$3
172349
650
2 4
$a
Mathematical Logic and Foundations.
$3
464911
650
2 4
$a
Logic.
$3
191646
700
1
$a
Kahle, Reinhard.
$3
635603
700
1
$a
Strahm, Thomas.
$3
636568
700
1
$a
Studer, Thomas.
$3
630559
710
2
$a
SpringerLink (Online service)
$3
463450
773
0
$t
Springer eBooks
830
0
$a
Progress in computer science and applied logic ;
$v
v.26.
$3
592138
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-29198-7
950
$a
Mathematics and Statistics (Springer-11649)
筆 0 讀者評論
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-29198-7
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入