Английская Википедия:Completeness of atomic initial sequents

Материал из Онлайн справочника
Версия от 22:49, 20 февраля 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} In sequent calculus, the '''completeness of atomic initial sequents''' states that initial sequents {{math|<VAR>A</VAR> ⊢ <VAR>A</VAR>}} (where {{math|<VAR>A</VAR>}} is an arbitrary formula) can be derived from only atomic initial sequents {{math|<VAR>p</VAR> ⊢ <VAR>p</VAR>}} (where {{math|<VAR>p</VAR>}} is an atomic formula). This theorem plays a role...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

In sequent calculus, the completeness of atomic initial sequents states that initial sequents Шаблон:Math (where Шаблон:Math is an arbitrary formula) can be derived from only atomic initial sequents Шаблон:Math (where Шаблон:Math is an atomic formula). This theorem plays a role analogous to eta expansion in lambda calculus, and dual to cut-elimination and beta reduction. Typically it can be established by induction on the structure of Шаблон:Math, much more easily than cut-elimination.

References

  • Gaisi Takeuti. Proof theory. Volume 81 of Studies in Logic and the Foundation of Mathematics. North-Holland, Amsterdam, 1975.
  • Anne Sjerp Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Edition: 2, illustrated, revised. Published by Cambridge University Press, 2000.

Шаблон:Mathlogic-stub