Holz M., Podewski K.-P., Steffens K. — Injective Choice Functions :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Holz M., Podewski K.-P., Steffens K. — Injective Choice Functions

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

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

Название: Injective Choice Functions

Авторы: Holz M., Podewski K.-P., Steffens K.

Язык:

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

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

ed2k: ed2k stats

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

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

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

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

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

$\lambda$ -constructive      52
$\varphi$ set      120
Antichain      77
Axiom of Choice      14
Axioms of set theory      12
Bijective      10
Bipartite graph      34
Bipartite graph, associated with F      34
Bipartite graphs disjoint      61
Bipartite graphs intersection of      61
Bipartite graphs join of      61
Bipartite graphs union of      61
c-good      116
Cardinal      11 23
cardinal number      11 23
Cardinal power      24
Cardinal product      24 27
Cardinal regular      11 26
Cardinal singular      11 26
Cardinal sum      24 27
Cardinality      11 23
Cartesian product      27
Choice function      1 11
Choice Lemma      12 31
class      14
Closed      11 28
Closure      41
Club      11 28
Cofina1      11 26
Cofinality      11 26
Compactness Theorem      74
Compactness Theorem for Hall families      102
Component connected      33
Constrained, B-constrained      51
Constructive pair      52
Continuous chain      42
Continuous function      28
Cotransversa      173
Countable      25
Cover      76
Critical      2 35
Critical set      35
Critical subfamily      35
Defect      104
Degree      33
demand      34
Demand cardinal      47
Demanded at stage $\alpha$       157
Diagonal intersection      30
Directed system      124
Disjoint family of paths      85
Disjoint graphs      61
Disjoint paths      79
Disjoint x - disjoint      85
Domain      10
EDGE      33
Edge doubly marked      81
Endpoint      33
Endvertex      33
Enumeration      11
Essential size      6 48
Family      1 10
Family $\alpha$ -finite      124
Family $\lambda$ -blocked      60
Family $\lambda$ -negative      48
Family $\lambda$ -positive      48
Family $\lambda$ -unblocked      60
Family critical      35
Family Hall      1 100
Family Milner — Shelah      166
Family Nash — Williams      159
Family Shelah      159
Family, associated with $\Gamma$       34
Family, closed under joining pairs      120
Family, closed under union of chains      120
finite      25
Fodor's Theorem      12 31
Frame in F      108
Frame of F      99 106
Free, B-free      51
Function      10
Function aleph-      25
Function continuous      28
Function margin      147
Function normal      28
Function regressive      11 30
Graph      33
Graph bipartite      34
Graph connected      33
Graph directed      35
Graph dual      34
Hall family      1 100
Hall's Condition      100
Impediment      63
Impediment in $\Gamma$       63
Impediment, $\varkappa$ -impediment      62
Impediment, l-impediment      62
incident      33
Induction principle      18
Infinite      25
Injective      10
Konig's Duality Theorem      76
LADDER      62
Ladder $\xi$ -ladder      62

Ladder, associated with a tower      625
Limit ordinal      11 17
Main Lemma      39 112 114
MAN      34
Man B-constrained      52
Man B-free      52
Margin function      147
Marriage      1 11
Marriage of a bipartite graph      34
Marriage of a family      35
Matchable      34
Matchable family      35
Matchable into a set      34
Matchable maximal, matchable set      104
Matching $\mu$ -admissible      49
Matching in a family      35
Matching in a graph      33
Matching of a set      34
Number natural      18
Number ordinal      15
Obstruction      63
Obstruction in $\Gamma$       63
Obstruction, $\varkappa$ -obstruction      621
Obstruction, l-obstruction      62
Omitted at stage $\alpha$       150
Omitted at stage l      149
Ordered pair      13
Ordering linear      15
Ordering partial      15
Ordering well-      15
Ordinal      15
Ordinal number      15
Ordinal sum      21
p-bad      128
P-critical      128
p-good      128
Path      33
Path A-B-      78
Path A-B-directed      78
Path directed      35
Path f-alternating      34
Path finite      33
Path one-way infinite      33
Path two-way infinite      33
Popular      85
Popular woman      85
Proper class      14
Property      14
QUEUE      127
Queue in F      127
Queue of F      127
RANGE      10
Rank function      106 132
Rank function canonical      141 144
Regressive      11 30
Relation      10 14
Restriction      10
Rung      62
Schroder — Bernstein theorem      23
SEQUENCE      11
Set A-B-separating      78
Set closed      11 28
Set critical      35
Set greatest critical      36
Set inductive      17
Set matchable      34
Set matchable in a family      35
Set maximal critical      36
Set of natural numbers      18
Set omitted at stage a      150
Set Set unbounded      11 26
Set stationary      11 30
Set unmarried at stage a      151
Size essential      6 48
Size of a set      126
Skeleton      133
Skeleton, canonical skeleton      153
Stable      140
Starting point      33
Stationary      11 30
Stationary family of paths      85
Subgraph      33
Subgraph induced      33
Subgraph saturated      34
Successor      17
Successor ordinal      11 17
Surjective      10
Surplus      103
Surplus maximal      103
Test negative $\mu$ -test      45
Test positive $\mu$ -test      44
Test positive special      160
Test special $\mu$ -test      159
Test, $\mu$ -test      7 42
Tower      62
Tower, $\xi$ -tower      62
Tower, associated with a ladder      62
Transfinite induction      18
Transfinite recursion      19
Transitive      15
Unmarried at stage a      151
Vertex      33
Well-ordering principle      22
Woman      34
Zorn's lemma      22

О проекте