Abramsky S., Gabbay D.M., Maibaum T.S.E. — Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Красота

Abramsky S., Gabbay D.M., Maibaum T.S.E. — Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods

Abramsky S., Gabbay D.M., Maibaum T.S.E. — Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods

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

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

Название: Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods

Авторы: Abramsky S., Gabbay D.M., Maibaum T.S.E.

Аннотация:

Logic is now widely recognized as one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and AI. The Handbook of Logic in Computer Science is a multi-volume work covering all the major areas of application of logic to theoretical computer science. The handbook comprises six volumes, each containing five or six chapters giving an in-depth overview of one of the major topics in field. It is the result of many years of cooperative effort by some of the most eminent frontline researchers in the field, and will no doubt be the standard reference work in logic and theoretical computer science for years to come. Volume 5: Algebraic and Logical Structures covers all the fundamental topics of semantics in logic and computation. The extensive chapters are the result of several years of coordinated research, and each have thematic perspective. Together, they offer the reader the latest in research work, and the book will be indispensable

Язык:

Рубрика: Computer science/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Context, identity morphism      70
Context, morphism      69
Context, morphism composition      69
Context, Th-provably equal      69
Contextual categories      101
Continuous domain      477
Coste, M.      41
Countability/cofiniteness condition      442
Countable connectivity condition      445
Course of values recursion      483
CPO      80
ctxt      103
cur      120
Curry-Howard interpretation      3
Data type theory      329 330—332 340
Data types      320 325 329 351
declaration      280
Default terms and values      349
Density/codensity condition      442
Dependent type      120
Dependently typed      105—106
Depth      139
Derivable formula      249
design specification      253
Disjoint union type      53
Domain      243 476—477
Duret, J.-L.      207
Dynamic signature      304
Dynamic sort      304
Dynamical systems      328 447—451 484
e(e')      51
Edalat A.      477 508
Effective algebra      321
Effective definitional schemes      339 487
Effective domains      476
Egidi, L.      208
Ehrenfeucht games      200
Element, generalized      49
Element, global      49
Elementary recursive      140
Emerson, E. A.      136
Empty type      57
Engeler's lemma      425 428 429 434 435 438 446
Engeler, E.      338—339 408 425 429 430 434 435 446 489 509
Environment      278
equation      240
Equation-in-context      45
Equational calculus      250
Equational logic      45 240
Equivalence sequence      263
Ersov, Y.      131 142 192 208
Esik, z.      75
Essentially algebraic      42 123
Evaluation homomorphism      234
Evaluation morphism      62
Exact computation      320—321 451
exception      303
Explicit definition      144
Exponential object      62
Export signature      284
Extension      238
Extension, $\mu$ -extension      238
Extension, a set of formulas persistent      248
Extension, of a set of formulas      248
Extension, persistent free      276
Extension, quotient term      275
F : $\sigma_{1},...,\sigma_{n}\rightarrow\tau$       43
f*A      79 111
Factorization      226
Fagin, R.      136
FALSE      85
Feferman, S.      209
Fenstad, J. E.      336 343 490 510
Ferrante, J.      146 148 186 191 194 196 202 210 211
Final algebra      224
Final specification      299
Finite algorithmic procedure      339 484
Finite algorithmic procedure with counting      485
Finite algorithmic procedure with stacking      486
Finite algorithmic procedures with index registers      487
Finite computation      320—321 331
Finite product, category with      45
Finite product, preservation of      68
Finite product, strict preservation of      68
Finite product, strictly associative      71
Finite product, strictly unital      71
Finite sequences      324
First-order languages      499
First-order logics      138
Fischer, M. J.      136 148 159 160 193 194 195 198 207
Flattening      281
Fleischmann, K.      132
flowchart      336—337 342
Flowchart for programming languages      376
Formal variables      138
Formula      239
Formula morphism      239
Formula, atomic      77
Formula, derivable      249
Formula, value of      242
Formula, well-formed      77
Formula-in-context      78
FP      74
Free ( $\varphi$ )      143
Free extension      274
Free extension, occurrence      242
Free extension, persistent      276
Freely generated      233
Freyd, P. J.      42 123
Fridman, E. I.      209
Fried, M.      207
Friedman, H.      339—340 484 487 510
Frobenius reciprocity      91
FST      59
Fuerer, M.      210 211
Function symbol, introductory axiom      102
Function symbol, term-valued      101
Function symbol, type-valued      101
Function type      60
Function, $\alpha$ -computable      333
Function, continuous      342 451—478
Function, discontinuous      451
Function, equationally definable      491
Function, order      404—405
Function, partial      317—532
Function, selection      497
Function, types      347
Function, uniformly continuous      474
Function, while computable      324 326—329 336 341 369
Function, while N computable      377
Function, while-array computable      325 335 378
Fundamental theorem of algebra      442
Generalised Church — Turing thesis      338 342 422 478 487 493—500 503
Generalised element      49
Generalised quantifiers      95
GENERATED      231
Generated, in some sorts      232
Generic, model      77 99 118—119
Generic, Th-algebra      72
Gentzen, G.      85 87 123
Girard, J.-Y.      40 100 123
Global element      49
Global section      114
Goedel completeness thorem      139
Goedel numbering      388
Graedel, E.      136
Grandjean, E.      137 141 211
Grothendieck fibration      114
Grothendieck, A.      114
Ground, equation      240

Ground, term      227
Ground, type      51
Group      321 327 328 346—347 353 370 395 416
Grzegorczyk, A.      474 475
Guarded command language      488
Gurevich, Y.      207 208
Halpern, J. Y.      136
Halting formula      426—429 433 437
Halting problem      417
Halting set      324 408 414 422 428 436 457
hard      141
Hardy, G. H.      195 197
Harel, D.      136
Height      139
Henkin, L.      210
Henson, C. W.      206
Hereditary      140
Hereditary lower bounds      131 132 140
Hierarchical specification      284
Higher-order logic      123
Hofmann, m.      113
Homomorphic extension      274
Homomorphism      223
Homomorphism condition      223
Homomorphism, bijective      223
Homomorphism, evaluation      234
Homomorphism, image of      223
Homomorphism, initial      244
Hopcroft, J.      140 159 200
Horn clause languages      500
Hyland, J. M. E.      41
Hyperdoctrine      80
Immerman, N.      200
implementation      297 300
Implicit definitions      145
Import signature      284
Inclusive subset      80
Indexed type      110
Induced subalgebra      225
Inductive, closure      246
Inductive, consequence      244
Inductive, type      62
Inference rule      249
Infinite streams      324 326 328 359—360 451 454 501—503
Inheritance condition      302
inherited      284
Initial algebra      224
Initial homomorphism      244
Initial module specification      286
Initial specification      257
Initialisations      408 413—414 436
Instantiation assumption      349 360
Institution      310
Internal language      41 48 95
Interpretation      167 175
Interpretation, iterative      167
Interpretation, monadic      175
Interpretation, prenex      167 175
Interpretation, simple      167 175
inv(L)      132 139
Invariance, from numberings      334 475—478
Invariance, homomorphism      371—372 422—423 454
Invariance, isomorphism      320 341 358 475 495
Isomorphism      223
Isomorphism property      239
Iterated map      448
Iteration theory      75
Iterative definition      145
junk      230
K      88
Kaufmann, M.      164 165
KL      80
Ko, K. I.      475 513
Kochen, S.      108
Koenig's lemma      469
Kokorin, A. I.      209
Korec, I.      185
Kozen, D.      136 140 193
Kozlov, G. T.      209
Kreisel, H.      211
Kripke, S.      100
Kutty, G.      136
L*      143
Label sort      304
Ladner, R.      136
Lafont, y.      42
Lambek, J.      65 123
Lawvere, F. W.      40 42 65 79 80 91 93 96 123
LCF      4
Length of a computation      365
let      66
Lewis, H. R.      136 193
Linear ATIME lower bounds      175
Linear logic      123
Linearly bounded      141
Listit      64
Listrec      62
Lo, L.      196
Locality of computation theorem      387
Locally confluent      263
Log-lin reduction      141
Logic      239
Logic with equality      239
Logic, conditional equational      241
Logic, equational      240
Logic, isomorphism property      239
Logic, predicate logic      241
Logic, satisfaction condition      239
Logic, with equality      239
Logical consequence      244
Logical consequence, in a domain      244
Loose module specification      286
Loose specification      253
Loveland, D.      210
lx      62
Lynch, J. F.      161 162
M $L_{0}$       138
M $L_{t}$       138
M $\Sigma_{r}$       135 171
M $\Sigma_{\infty}$       135 171
M : $\sigma[\Gamma]$       44 103
M = M' : $\sigma[\Gamma]$       103
Machtey, M.      140
Macintyre, A.      210
Makkai, M.      81
Many-sorted signatures      see "Signatures"
Martin-Loef, P.      51 100
Maurin, F.      136 195 196
McCarthy, J.      338 340 515
McNaughton, R.      211
Merging two procedures      409—410 420
Meta-expression      51
Meyer, A.      159 160 184 185 193
Michel, P.      136 196
Model      243
Model, of a dependently typed theory      117
Model, of a predicate theory      97
Model, of computation      320 323 325 335—340 458—460 475—503
Model, oriented semantics      283
Modularized abstract data type      285
Module      285
Module signature      284
Module specification, initial      286
Module specification, loose      286
Module specifications      287
Moggi, E.      41 66
Monadic interpretability      175
Monadic second-order logics      138
Monomorphic      224 285
Morphism, formula morphism      239

1 2 3 4

Реклама

© Электронная библиотека попечительского совета мехмата МГУ, 2004-2025

Электронная библиотека мехмата МГУ

Valid HTML 4.01!

|

Valid CSS!

О проекте