Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Troelstra A.S. — Basic proof theory
Troelstra A.S. — Basic proof theory



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Basic proof theory

Автор: Troelstra A.S.

Аннотация:

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of first-order logic formalization. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic, logic programming theory, category theory, modal logic, linear logic, first-order arithmetic and second-order logic. In each case the authors illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. For the new edition, they have rewritten many sections to improve clarity, added new sections on cut elimination, and included solutions to selected exercises. 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.


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1

Год издания: 1996

Количество страниц: 353

Добавлена в каталог: 02.11.2010

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Segment      138
Segment, maximal      138
Segment, minimum      146
Semantic tableau      74 109—112 256
Separation      57 84 85 106 148
Sequence, reduction      11
Sharpened Hauptsatz      136
Shoesmith      170
Side formula      53
simple type      9
Simplification contraction      140
Size leaf-      8
Size of a formula      8
Size of a tree      8
Skolem      97
Slash, Aczel      86 107
SLD-derivation      180
SLD-resolution, completeness for      183
SLD-resolution, soundness for      181
Smullyan      47 109 169
Sn      11
Socher — Ambrosius      106
Solovjov      223
Soundness for linear resolution      181
Stability      41
Stability axiom      61
Stability schema      264
Staelmarck      169
Staerk      197
Strictly positive part      5
Strong normalization      142 157 164 215
Strong normalization, reduction of      160
Strongly normalizing      11
Subformula      4
Subformula (segment)      138
Subformula property      57 84 148
Subformula, literal      4
Subformula, negative      5
Subformula, positive      5
Subformula, strictly positive      5
Substitution      3 4 10 174
Substitution, idempotent      176
Substitution, identical      174
Substitution, rule      48
Substitution, variable      174
Substitutivity      13 14
Succedent      53
Successful      181
Successful, unrestrictedly      181
Successor      8
Successor, immediate      8
Sum, Hessenberg      261
Sum, natural      261
Switching      250
System F      291
System, Hilbert      42 48
Szabo      73
T-axiom      226
Tableau, semantic      74 109—112 256
Tait      14 74 135 170 271 307
Tait calculus      75
Takahashi      307
Takeuti's conjecture      307
Takeuti, ix      108 169 284 285
Tarski      49
Tci-deduction graph      201
Tensor      236
Tensor link      247
Term calculus for G2i*      63
Term calculus for Ni      37
Theorem approximation      239
Theorem Beth's definability      91
Theorem coherence      216 223—224
Theorem deduction      48
Theorem Herbrand's      89 127 135
Theorem midsequent      136
Theorem modal deduction      227
Theorem ordering      127 131 135
Theorem separation      84 85 106 148
Track      144
Track, main      147
TREE      7
Tree, deduction      20
Tree, derivation      20
Tree, labelled      8
Tree, reduction      11
Troelstra      1 29 46 48 49 97 98 107 109 142 169 170 223 239 257 258 306 308
Truth arrow      201
Truth function      281
Truth predicate      281
Turing      169
Type abstraction      291
Type application      291
Type function      9
Type simple      9
Uesu      107
Ungar      170
Unification      177 197
Unifier      176
Unifier, most general      176
Unifier, relevant      176
Unsuccessful      181
Unsuccessful, unrestrictedly      181
Urquhart      136
Valentini      257
Variable arrow      202
Variable assumption      37
Variable free      4 10
Variable proper      31
variable substitution      174
variable type      9
Variable-permutation      175
Variant      175
Voreadou      223
Vorob'ev      109
Vrijer, de      223
w.l.o.g.      2
Wajsberg      106 223
Wansing      257
WCR      12
Weak second-order extension      151
Weakening      52
Weakening, depth-preserving      56
Weight      103
Zucker      170
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте