New subject: [再送] WIAS Seminar: “The epsilon calculus with equality predicate and Herbrand complexity” (September 10, Waseda University)

23 Aug 2018


      皆様，
(重複して受け取られた場合はご容赦ください)
早稲田大学の藤原誠です．
9月10日(月)に早稲田大学早稲田キャンパスにてインスブルック大学の宮本賢治さんをお迎えしてセミナーを開催いたします．
ヨーロッパで研究をされている宮本さんの日本での貴重なご講演です．
参加自由ですのでどうぞふるってご参加下さい．
なお，今回の講演は英語で行われます．
予めご了承下さい．
詳細については以下のページをご参照下さい．
https://www.waseda.jp/inst/wias/news/2018/08/23/5646/
日時：2018年９月10日(月)16:00-17:30
Date & Time: Monday, 10 September 2018, 16:00 – 17:30
場所：早稲田大学早稲田キャンパス9号館5階第1会議室
Venue: Meeting room #1 on the 5th floor, Building #9, Waseda University
Speaker:
Kenji Miyamoto (University of Innsbruck, [email protected])
Title:
The epsilon calculus with equality predicate and Herbrand complexity
Abstract:
Hilbert's epsilon-calculus is based on an extension of the language of
predicate logic by a term-forming operator $\varepsilon$ [1].  Two
fundamental results about the epsilon-calculus, the first and second
epsilon theorem, play a role similar to that which the cut-elimination
theorem plays in sequent calculus.  In particular, Herbrand's Theorem
is a consequence of the epsilon theorems.  Moser and Zach study the
epsilon theorems and the complexity of the elimination procedure
underlying their proof, as well as the length of Herbrand disjunctions
of existential theorems obtained by this elimination procedure [2].
We extend their results to epsilon-calculus with equality predicate.
This is joint work with Georg Moser.
[1] D. Hilbert and P. Bernays,
Grundlagen der Mathematik, vol. 2, Springer Berlin, 1939.
[2] G. Moser and R. Zach,
The epsilon calculus and Herbrand complexity,
Studia Logica, vol. 82 (2006), no. 1, pp. 133--155.
============================================
藤原 誠 (Makoto Fujiwara)
早稲田大学高等研究所
(Waseda Institute for Advanced Study, Waseda University)
E-mail: [email protected]
============================================