|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| Hein J.L. — Discrete Structures, Logic, and Computability |
|
|
|
| Предметный указатель |
Grammar, type 3 751
Grammar, unrestricted 749
Graph 41—48
Graph, acyclic 45
Graph, breadth-first traversal 46
Graph, chromatic number 42
Graph, complete 42
Graph, connected 45
Graph, depth-first traversal 47
Graph, directed, digraph 43
Graph, edge 41
Graph, multigraph 43
Graph, n-colorable 42
Graph, path 45
Graph, path problems 183—189
Graph, planar 42
Graph, spanning tree 51
Graph, subgraph 44
Graph, traversal 46
Graph, vertex, node 41
Graph, weighted 44
Greatest common divisor 25 65 245
Greatest common divisor, properties 66
Greatest element 214
Greatest lower bound 214
Greek alphabet 851
Greibach normal form 688
Greibach, S.A. 688 846
Group 511
Groupoid 511
Growth rates 296—303
Growth rates, big oh 301
Growth rates, big omega 301
Growth rates, big theta 296
Growth rates, little oh 300
Growth rates, lower 300
Growth rates, same order 296
Haken, W. 43 845
half-adder 523
Halmos, P.R. 227 846
Halting problem 740
Hamilton, A.G. 846
Handle 672
Hash function 94
Hasse diagram 213
Hasse, Helmut 213
Head of list 34 114
Head of string 118
Height 48
Hein, J.L., xv 846
Hennessy, M. 550 846
High school algebra 503
Higher-order function 83—88 157
Higher-order function, altMap 85
Higher-order function, apply 85
Higher-order function, insert 87
Higher-order function, map 84 157
Higher-order logic 437—445
Higher-order reasoning 443
Higher-order semantics 442
Higher-order unification 476 766
Higher-order wff 439
Hilbert, D. 343 444 744 846
Hilbert’s Tenth Problem 744
Hindley, J.R. 846
Hisab al-jabr w’al-muqabala 501
Hoare, C.A.R. 433 847
Homomorphism 567
Hopcroft, J.E. 847
Horn clause 478
HS see “Hypothetical syllogism”
Hypothesis 3 309 329
Hypothetical syllogism 331
id see “Instantaneous description”
Idempotent 519
Identifier 141 587
Identity element 506
Identity function 78
If and only if 8
If-then rule 420
If-then-else function 63
If-then-else rule 421
IFF see “If and only if”
Image 61
Immediate left recursion 663
Immediate predecessor 213
Immediate successor 213
Implication 309
Implies 3
Incidence matrix 184
Inconsistent 332
Indegree 45
Indirect left recursion 664
Indirect proof 7 338—341
Indirect proof rule 338
Individual constants 356
Individual variables 356
Induced relation 179
Induction algebra 510
Inductive definition 110
Inductive definition, binary trees 120
Inductive definition, language of a grammar 136
Inductive definition, lists 113
Inductive definition, natural numbers 111
Inductive definition, product sets 122
Inductive definition, strings 117
Inductive proof 229—243
Inductive set 110
Inference rule 306 329
Inference rule, addition 331
Inference rule, binary resolution 475
Inference rule, conjunction 331
Inference rule, constructive dilemma 347
Inference rule, destructive dilemma 347
Inference rule, disjunctive syllogism 331
Inference rule, existential generalization 394
Inference rule, existential instantiation 386
Inference rule, factoring 475
Inference rule, general resolution rule 469
Inference rule, hypothetical syllogism 331
Inference rule, modus ponens 306 330
Inference rule, modus tollens 307 331
Inference rule, paramodulation 475
Inference rule, resolution 454
Inference rule, resolution for propositions 461
Inference rule, simplification 331
Inference rule, universal generalization 390
Inference rule, universal instantiation 384
Infinite list 36
Infinite polynomial 283
Infinite sequence 36
Infinite set 12 98—105
Infinite set, continuum hypothesis 105
Infinite set, countable 99
Infinite set, diagonalization 103
Infinite set, uncountable 99
Infix expression 41 61
Informal proof 2 308
Inherit 563
Initial functions 718
Initial stack symbol 642
Initial state 585
Injection 90
Injective function 90
Innermost redex 757
InOrder 162 542
Insert for binary functions 87 170 551
Insert, into binary search tree 160 240 245
Insert, into priority queue 543
Insert, into sorted list 156 244
| Instance of a set 463
Instance of a wff 368
Instance of an expression 463
Instantaneous description 644
Integers 4 12
Interpretation 359
Interpreter for DFAs 602
Interpreter for NFAs 605
Interpreter for PDAs 656
Interpreter for Turing machines 709
Intersection, bags 25
Intersection, collection of sets 18
Intersection, properties 18
Intersection, sets 18
Invalid 362
Inverse element 507
Inverse function 92
Inverse image 62
Invertible function 92
Involution law 521
IP see “Indirect proof rule”
Irreflexive 175
Irreflexive partial order 212
Isomorphic 567
Isomorphism 567
Item 679
Iverson’s convention 304
Jefferson, Thomas 351
Join operation 547
Kernel, factorization 204
Kernel, partition 202
Kernel, relation 202
Key 94
Kleene, S.C. 586 723 847
Knuth — Bendix completion 766—772
Knuth — Bendix completion, inference rules 768—769
Knuth — Bendix completion, procedure 769
Knuth — Bendix completion, specialization order 768
Knuth, D.E. 304 672 772 M6 847
Konigsberg bridges 46
Kruskal, J.B., Jr. 206 847
Kruskal’s algorithm 206
Kurki-Suonio, R. 671 847
Lambda calculus 754—766
Lambda calculus, abstraction 754
Lambda closure 612
Lambda expression 754
Language 126—144
Language of a grammar 136
Language of a Turing machine 699
Language, closure 130
Language, context-free 640—642 685—694
Language, context-sensitive 748
Language, deterministic context-free 659
Language, hierarchy 747—751
Language, morphism 570 572 635 636 693 694
Language, nonregular 632
Language, parse 130
Language, positive closure 130
Language, product 128
Language, properties of closure 130
Language, properties of product 129
Language, recursively enumerable 749
Language, regular 576—583 626—635
Language, well-formed formula 127
Lattice 215 228 529
Law of identity 407
Laws of exponents 151
Lazy evaluation 166
LBA see “Linear bounded automaton”
LCM see “Least common multiple”
Leaf 48
Least common multiple 25
Least element 214
Least upper bound 214
Lee, R.C. 474 M5
Left factoring 661
Left subtree 50
Left-recursive grammar 662
Left-recursive grammar, immediate 663
Left-recursive grammar, indirect 664
Leftmost derivation 136
Leibniz, Gottfried Wilhelm von 59
Length, list 34 152 535
Length, path 45
Length, string 36
Length, tuple 31
Less relation 533
Lewis, P.M. 659 847
Lexicographic order 221
LHopital’s rule 300
LIFO property 537
Linear bounded automaton 748
Linear order 211
Linear probing 95
Linearly ordered set 211
LIST 34—36 113—117 151—157 534—536 762
List, cons 114
List, empty 34
List, generalized 35 117
List, head 34 114
List, infinite 36
List, length 34 152 535
List, stream 36 165—169
List, tail 34 114
Literal 320 376 455
Little oh 300
Liu, C.L. 847
LL(k) grammar 659
LL(k) parsing 659—672
LOG function 72
Logarithm see “Log function”
Logic circuit see “Digital circuit”
Logic gate 522
Logic program 479
Logic programming 450—454 478—498
Logic programming language 730—732
Logic programming, atom 450
Logic programming, backtracking 489
Logic programming, breadth-first search strategy 492
Logic programming, clause 478
Logic programming, computation tree 488
Logic programming, depth-first search strategy 488
Logic programming, goal 451 479
Logic programming, program 479
Logic programming, relations 493
Logic programming, SLD-resolution 483
Logic programming, techniques 493—498
Logic, Absorption laws 314
Logic, DeMorgan’s laws 314
Logic, first-order 439
Logic, first-order predicate calculus 355
Logic, fuzzy 350
Logic, higher-order 437—445
Logic, modal 350
Logic, monadic 476
Logic, n-valued 349
Logic, nth-order 441
Logic, partial order theory 411
Logic, programming 478—498
Logic, three-valued 349
Logic, two-valued 349
Logic, zero-order 439
Lookahead symbol 659
Loop 45
Loop invariant 422
Lower bound 214
LR(1) grammar 674
LR(1) parse table 679—684
LR(1) parsing 676
|
|
|
| Реклама |
|
|
|
|
|
О проекте