Английская Википедия:Decidable sublanguages of set theory

Материал из Онлайн справочника
Версия от 22:10, 25 февраля 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} {{Notability|date=May 2021}} In mathematical logic, various sublanguages of set theory are decidable.<ref>Cantone, D., E. G. Omodeo and A. Policriti, "Set Theory for Computing. From Decision Procedures to Logic Programming with Sets," Monographs in Computer Science, Springer, 2001.</ref><ref>[http://portal.acm.org/citation.cfm?id=120986.120991&coll=GUID...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

Шаблон:Notability In mathematical logic, various sublanguages of set theory are decidable.[1][2] These include:

  • Sets with Monotone, Additive, and Multiplicative Functions.[3]
  • Sets with restricted quantifiers.[4]

References

  1. ↑ Cantone, D., E. G. Omodeo and A. Policriti, "Set Theory for Computing. From Decision Procedures to Logic Programming with Sets," Monographs in Computer Science, Springer, 2001.
  2. ↑ "Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability", by Franco Parlamento and Alberto Policriti Journal of Automated Reasoning, Volume 7, Issue 2 (June 1991), Pages: 271 - 284
  3. ↑ "A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions", by Domenico Cantone and et al.
  4. ↑ "A tableau-based decision procedure for a fragment of set theory involving a restricted form of quantification", by Domenico Cantone, Calogero G. Zarba, Viale A. Doria, 1997Шаблон:Dead link
Партнерские ресурсы
Криптовалюты
Магазины
Хостинг
Разное

Источник — http://wikihandbk.com/ruwiki/index.php?title=Английская_Википедия:Decidable_sublanguages_of_set_theory&oldid=14244287