Cargando…

Proof Theory

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Jervell, Herman Ruge
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin : Logos Verlag Berlin, 2013.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Mu 4500
001 EBOOKCENTRAL_on1089606153
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|---|||||
008 190309s2013 gw o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d CHVBK  |d OCLCO  |d OCLCF  |d OCLCQ  |d YDX  |d OCLCQ  |d UEJ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 1089405778 
020 |a 9783832589998 
020 |a 3832589996 
020 |z 9783832533038 
020 |z 3832533036 
029 1 |a AU@  |b 000065431363 
029 1 |a CHNEW  |b 001040636 
035 |a (OCoLC)1089606153  |z (OCoLC)1089405778 
050 4 |a QA9.54  |b .J478 2012 
082 0 4 |a 511.3  |2 23 
049 |a UAMI 
100 1 |a Jervell, Herman Ruge. 
245 1 0 |a Proof Theory 
260 |a Berlin :  |b Logos Verlag Berlin,  |c 2013. 
300 |a 1 online resource (131 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
588 0 |a Print version record. 
505 0 |a Intro; 1 Direct arguments; 1.1 Auxiliary constructions ... .; 1.2 Sequent calculus ... .; 1.3 Cut elimination ... ; 1.4 epsilon-calculus ... ; 1.5 Other systems ... .; 1.6 Infinitary proofs ... .; 2 Gentzen games; 2.1 Gentzen trees ... .; 2.2 Syntactic moves ... ; 2.3 Strong termination ... ; 3 Ordinals 
505 8 |a 3.1 Well Orderings ... 3.2 Arithmetical operations ... .; 3.3 Delayed decisions ... .; 4 Transfinite induction; 4.1 Transfinite induction ... ; 4.2 Ordinal bounds ... ; 4.3 Bounds for provable transfinite induction ... ; 4.4 Arithmetical systems ... ; 5 Quantifiers; 5.1 Skolem and quantifiers ... . .; 5.2 Gödels interpretation ... 
505 8 |a 5.3 The proof ... 5.4 Discussion ... ; 5.5 Spectors interpretation ... . .; 5.6 epsilon-calculus ... ; 6 Finite trees; 6.1 Ordering trees ... .; 6.2 Deciding the ordering ... . .; 6.3 Embeddings ... . .; 6.4 Some calculations ... .; 7 Constructing trees; 7.1 Building up from below ... 
505 8 |a 7.2 Normal functions and ordinal notations ... 7.3 Further calculations ... ; 7.4 Proof of wellordering ... ; 8 Combinatorics; 8.1 Ramseys theorem ... .; 8.2 Kruskals theorem ... .; 8.3 Linearization ... .; 8.4 Transfinite induction ... ; 9 Labeled trees; 9.1 Extending finite trees ... . .; 9.2 Well ordering of finite labeled trees ... 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Proof theory. 
650 6 |a Théorie de la preuve. 
650 7 |a Proof theory  |2 fast 
758 |i has work:  |a Proof theory (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGRvpxhDdW9V9DrFxJydpP  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Jervell, Herman Ruge.  |t Proof Theory.  |d Berlin : Logos Verlag Berlin, ©2013  |z 9783832533038 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5722993  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL5722993 
938 |a YBP Library Services  |b YANK  |n 16089775 
994 |a 92  |b IZTAP