Langholm T. — Partiality, Truth and Persistence :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Langholm T. — Partiality, Truth and Persistence

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

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

Название: Partiality, Truth and Persistence

Автор: Langholm T.

Аннотация:

Despite many applications, a number of mathematically intriguing questions associated with the concept of semantical partiality have received only very limited attention. This volume is a study in spatial model theory, the theory of partially defined models.

Язык:

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

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

ed2k: ed2k stats

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

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

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

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

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

Arity ()      43
As strong as ( $\leq$ )      8 36
Binding condition      65
Binding property      71
Bottom ( $\perp$ )      17 44
CNA      66
Coherence      5 14
Coherence, condition      46
compl      30 49
Completion      13 44
Compositional      18 26
Conjunction ( $\wedge$ )      17 44
Conjunction ( $\wedge$ ), finite      62
Consistency      114
contr      31 55
Contraction rule      82
Count ably left-compact      130
Countable neighborhood, assignment (cna)      66
Countably compact      113
Cut rule      73
Cut-and-glue theorem      32
Depth (dft)      70
Derivability      77
Determinability      3 18
Disjunction, finite      38 62 82
Disjunction, strong ( $\vee$ )      14
Disjunction, weak ( $\tilde{\vee}$ )      20
Distinguish      65
Domain of a structure (|M|)      44
Domain persistence      56
Equivalence, positive ( $\equiv$ )      17
Equivalence, relative to $\models_x$ ( $\equiv_x$ )      65
Equivalence, semantic ( $\equiv$ )      60
Equivalence, strong ( $\rightleftharpoons$ )      11 17
Exclusion negation ( $\sim$ )      11 17
Existential      44 53
expansion      122
Expressive power      1
Extension of a language      17 46 110 113 125
Falsity-persistence      30 120
Formula      14 44
Free variable      60 82
Generalized model      21
Generalized strong Kleene truth definition ( $\models^*$ )      10 38 70
Generalized structure      46
Identity (=)      43
Increasing formula      30 53
Independence condition      65
Independent substitution lemma      50
Informational completion      13 44
Informational extension ( $\ll$ )      13 44
Interpolation theorem      51
Inverse translation ( $\varphi^{-*}$ )      22 27 46 111
Isomorphic ( $\cong$ )      59
Isomorphic ( $\cong$ ), $\omega$ -partially ( $\cong_{\omega}$ )      60
Isomorphic ( $\cong$ ), partially ( $\cong_p$ )      100
Isomorphism condition      65
Language (, $\mathcal{L}^*$ )      13 28 43 112
Lindstrom theorem      12 110
Lowenheim property      99 113
Minimal witness      93
Model (v, M)      13 44
Monomorphic ( $\tilde{\ll}$ )      59
Monomorphic ( $\tilde{\ll}$ ), impartially ( $\tilde{\ll}_{\omega}$ )      59

Monomorphic ( $\tilde{\ll}$ ), partially ( $\tilde{\ll}_p$ )      100
Natural sum ( $\natural$ )      73
Negation ( $\neg$ )      14
Negation ( $\neg$ ), exclusion ( $\sim$ )      17
Negation ( $\neg$ ), forcing ( $\frown$ )      132
Negative equivalence      17
Negative translation ( $\varphi_*$ )      22
Neighborhood assignment ( $\xi$ )      87
Non-transitive chain (ntc)      104
Operator depth ( $c_{\varphi}$ )      38
Partiality      1
Persistence      4 15 56
Positive equivalence ( $\equiv$ )      17
Positive equivalence theorem      25
Positive formula      101
Positive sentence      22
Positive translation ( $\varphi^*$ )      22 26 46 111
Positive translation ( $\varphi^*$ ), inverse ( $\varphi^{-*}$ )      22 27 46 111
Predictive      40 101
Predictive, $\models_x$       103
Prenex formula      60
Preserved under extension of domain      52
Quantifier rank (qrk)      60
Relation symbol (R)      43 51
Relatively saturated      35
Reliability      6 18
Restriction ( $\uparrow$ )      16 45 52
Rooted ( $\lhd$ )      67
Saturated formula      103
Saturated sentence      36 41
Semantic equivalence ( $\equiv$ )      60
Sentence      14
Sentence, signed      16
Sentence, symbol (5)      13 48
Similarity type ( $\rho$ )      13 43
Situation semantics      2
Skolem property      66 113
Strong equivalence ( $\rightleftharpoons$ )      11 17
Strong equivalence theorem      25
Strong Kleene truth definition ( $\models$ )      7 14 44
Strong syntactic closure (sscl)      10 80
Strongly preserved under extension of domain      57
Structure (M)      44
Substitution function ( $\varphi(\psi, \chi/\alpha)$ )      23 48
Substitution property      71
Substitution theorem      49
Supervaluation      8 36 77 88
Syntactic closure (scl)      37
Syntactic closure (scl), strong (sscl)      10 80
Syntactic closure (scl), weak (wscl)      10 80
Thinning property      71
Top      14 44
Translation function ( $\varphi^*$ , $\varphi_*$ )      46 111
Translation procedure      22
TREE      70
Trivialization ( $\nabla$ )      50
Truth definition ( $\models$ )      14 20 36 47 65 77 87
Truth functional completeness      27
Truth table      18
Truth value $(0, 1, \wr, \times)$       18 26
Truth-persistence      30 120
Verification tree      70
Weak Kleene truth definition ( $\models_{\omega}$ )      20
Weak syntactic closure (wscl)      10 81

О проекте