"On an arithmetic in a set theory within Lukasiewicz logic"

logic 国際会議 拙論

朝メールチェックをすると国際会議 ”THE ALGEBRAIC AND TOPOLOGICAL METHODS IN NON-CLASSICAL LOGICS III (TANCL'07)” 事務局からメールがいていた。要旨が、無事にacceptされたそうです。内容は、単なるこれまでの成果のレビューです。
要旨は以下の通り（くわしくはここをご覧下さい）。

A significance of the set theory with the comprehension principle is to allow a general form of the recursive definition [1]: For any formula j(x, ..., y), the comprehension principle implies (∃z)(∀x)[x ∈ z ≡ j(x, ..., z)] within CFLew, i.e. we can define a set z by using a parameter z itself. This allows us to represent any partial recursive function on ω.
Let H is a set theory with the comprehension principle within ukasiewicz infinite-valued predicate logic with its standard semantics. It has been conjectured that H is enough strong to develop an arithmetic because the recursive definition on w can be used in place of mathematical induction: We review about this. The arithmetic in H is somehow similar to one in "non-standard models" of PA[2]. For example, we can prove an overspill-like phenomenon. However H is ω-inconsistent and the mathematical induction on ω implies a contradiction in H [2], and their proofs can be modified to be very simple and effective even in any linearly ordered MV-algebra [3].
References

  1. Andrea Cantini.: The undecidability of Grisn's set theory. Studia logica 74 345-368 (2003)
  2. Shunsuke Yatabe.: Distinguishing non-standard natural numbers in a set theory within ukasiewicz logic. Accepted to Archive for Mathematical Logic.
  3. Shunsuke Yatabe.: Recursion contradicts to induction within Lukasiewicz logic. Accepted to Many Valued Logic and Cognition - Trends in Logic V Conference in July 2007.

ところでこの通知メール、本文が

Your submission has been accepted by the conference organizers.

だけのそっけなさ。コンピューターによる自動作成らしいのだけれど。