An algebraic version of the Strong Black Box
Various versions of the prediction principle called the “Black Box” are known. One of the strongest versions can be found in [EM]. There it is formulated and proven in a model theoretic way. In order to apply it to specific algebraic problems it thus has to be transformed into the desired algebr...
Збережено в:
| Видавець: | Інститут прикладної математики і механіки НАН України |
|---|---|
| Дата: | 2003 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2003
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/155695 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Цитувати: | An algebraic version of the Strong Black Box / R. Göbel, S.L. Wallutis // Algebra and Discrete Mathematics. — 2003. — Vol. 2, № 3. — С. 7–45. — Бібліогр.: 9 назв. — англ. |
Репозиторії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | Various versions of the prediction principle called
the “Black Box” are known. One of the strongest versions can
be found in [EM]. There it is formulated and proven in a model
theoretic way. In order to apply it to specific algebraic problems
it thus has to be transformed into the desired algebraic setting.
This requires intimate knowledge on model theory which often prevents algebraists to use this powerful tool. Hence we here want to
present algebraic versions of this “Strong Black Box” in order to
demonstrate that the proofs are straightforward and that it is easy
enough to change the setting without causing major changes in the
relevant proofs. This shall be done by considering three different
applications where the obtained results are actually known. |
|---|