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

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

blank
blank
blank
Красота
blank
Monk J.D. — Mathematical Logic
Monk J.D. — Mathematical Logic



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



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


Название: Mathematical Logic

Автор: Monk J.D.

Аннотация:

From the Introduction: "We shall base our discussion on a set-theoretical foundation like that used in developing analysis, or algebra, or topology. We may consider our task as that of giving a mathematical analysis of the basic concepts of logic and mathematics themselves. Thus we treat mathematical and logical practice as given empirical data and attempt to develop a purely mathematical theory of logic abstracted from these data."

There are 31 chapters in 5 parts and approximately 320 exercises marked by difficulty and whether or not they are necessary for further work in the book.


Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Measurable cardinal      512
Meredith, C.      132
Metalanguage      6
Minimal degree      106
Minimalization      78
Minsky, M.      25
Modal logic      139
Model      121 196
Model completeness      234 354
Model existence theorem      313
modus ponens      117 171
Monadic second-order logic      490
Monk, J.D.      4 5 7 8 228 512 517
Montague, R.      485
Mostowski, A.      4 8 217 242 277 279 450 453 502
Multiplication      27
Mycielski, J.      512
Myhill, J.      111
n-type      441
Negation symbol      162
Nonlogical constants      164
Nonstandard analysis      341
Nonstandard mathematics      341
Nonstandard natural numbers      341
Nonstandard number theory      341
Nonstandard real numbers      341
Nonterminating algorithmic step      69
Normal Form Theorem      80
Novikov, P.      111
Number-theoretic function      26
Number-theoretic relation      30
Occurrence      69
Occurs in      69 169
Omits      441
Omitting types theorem      442
Operation symbol      162
Oracle      105
Orey, S.      442
Padoa's method      368
Pairing function      56
Parentheses      132
Parenthesis-free notation      116
Parovicenko, I.      517
Partial function      76
Partial functional      107
Partial recursive function      78
Partial recursive functional      107
Partitioning sequence      376
Peter, R.      26 41
Platonism      3
Polish notation      116
Positive formula      402
Possible definition      208
Post, E.      131
Pour-El, M.      277
Prenex normal form      187
Presburger, M.      234
Presentation      110
Preservation theorem      391
Prime      343
Prime model      358
Primitive formula      356
Primitive recursion      77
Primitive recursive function      34
Primitive recursive operations      35
Primitive recursive relation      35
Primitive Skolem expansion      211
Primitive structure      486
Primitive term      312
Principal ultrafilter      321
Principia Mathematica      3
Priority arguments      106
PRODUCT      318
Productive set      97
Projective class      406 418
Proper substitution      179
Pseudoelementary class      406
Quantifier on      176
Quantifier-free      187
Quantifier-free combinations      234
Quasivariety      398
Quine, W.      192
r.e.      92
Rabin, M.      234 242 296 490 491 502
Ramsey's theorem      448
Real closed ordered field      361
Realizes      441
Recursion on formulas      169
Recursion on terms      168
Recursion principle      117
Recursion theorem      82
RECURSIVE      46 109
Recursive equivalence type      108
Recursive function      45 105
Recursive in      105
Recursive real numbers      109
Recursively axiomatizable      246
Recursively converges      109
Recursively enumerable      92 96 107 425
Recursively inseparable      100
Recursively separable      100
Reduct      201
Regular ultrafilter      324
Relation symbol      162
Relation system      396
Relational version      206
Relativized reduct      395
Remainder      412
RET      108
Reznikoff, I.      374
Rice, H.      84
Rich      198
Rich by C.      311
Robinson's consistency theorem      367
Robinson, A.      4 8 329 341 348 354
Robinson, J.      45 56 58 64 111 257 279 280
Robinson, R.M.      66 217 242 277 279
Rogers, H.      90 102
Rogers, R.      3 8
Russell, B.      3 6
Ryll-Nardzewski, C.      447
Satisfies      196
Saturated      454
Schmidt, H.      131
Schwabhauser, W.      234
Scott, D.      352 505 512 517
Second-order logic      491
Self-reference theorem      275
Sentence      187
Sentential language      115
Shelah, S.      6 406 427 435 439
Shoenfield, J.      191 217 260
Sikorski, R.      160
Simple ordering structure      449
Simple set      101
Skolem expansion      211 481
Skolem Functions      212
Skolem normal form theorem      212
Skolem paradox      334
Skolem set      211
Skolem, T.      234 382
Slomson, A.      502
Smullyan, R.      102 311
Special function      45
Special structure      466
Specker, E.      465
Spectrally represented      254
Standard part      345
States      14
Stone space      161
Strong theory      298
Strongly compact cardinal      507
Strongly recursively inseparable      103
Subalgebra      222
Subdirect product      392
Subformula      169
Substitution      178
Substitutivity of equivalence      184
Substructure      328
Subuniverse      144 222 330
Subuniverse generated by      144 222
Summation      27
Suszko, R.      400
Svenonius, L.      447
Symbol      115
Symbolic      3
Symbols of $\mathscr{L}$      164
Syntactic definability      13
Syntactical $\mathscr{L}$-structure      216
Syntactically defined      244
Szmielew, W.      234
Taimanov, A.      242 260 277 296
Taitslin, M.      242 260 277 280 296
Tape description      15
Tarski, A.      131 161 191 217 228 234 242 276 277 279 280 339 361 392 397 489 512 517
Tautology      121 169
Term-defines      195
Terminating algorithmic step      69
Theorems      171
Theory      208
Theory of      208 406
Theory of equality      240
Theory of types      493
Three-valued logic      135
Total function      76
Total functional      107
Trachtenbrot, B.      257 279
Translation conditions      206
Tree property      517
True in      196
Truth      121
Truth function      128
Truth table      121
Truth valuation      169
Turing computability      45
Turing computable      76
Turing computable function      45 105
Turing degree      105
Turing equivalent      105
Turing machine      14 45
Twin-prime conjecture      344
Two-way homomorphism      475
TYPE      493
Type symbol      493
Type theory      6
Ulam, S.      512
Ultrafilter      149 317
Ultrapower      320
Ultraproduct      317 320
Ultraroot      439
Undecidable theory      233 279
Underlying set      142
union      338
Unique readability      116 167
Uniqueness condition      206
UNIVERSAL class      393
Universal formula      212
Universal function      47
Universal Horn formula      398
Universal partial recursive function      81
Universal quantifier      162
Universal sentence      393
Universal specification      182
Universal Turing machine      80
Universal-existential formula      400
Universally valid      196
Universe      142
Unprovability of consistency      298
Upward Lowenheim — Skolem theorem      335
Van der Waerden, B.      361
Variety      384
Vaught, R.      154 378 379 445 446 447 457 502
Vector space      352
Weak Church's thesis      46
Weak completeness theorem      204
Weak direct product      382
Weak effectivized general logic      424
Weak general Logic      417
Weak second-order logic      488
Weakly compact cardinal      507
Weakly syntactically defined      245
Whitehead, A.      3 6
Word      69
Word problem for groups      110
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте