一覧に戻る

タイトル
  • The strength of SCT soundness
作成者
    • Frittaion, Emanuele
    • Pelupessy, Florian
    • Steila, Silvia
    • Yokoyama, Keita
権利情報
  • (c) The Author, 2018. Published by Oxford University Press. This is a pre-copy-editing, author-produced PDF of an article accepted for publication in JOURNAL OF LOGIC AND COMPUTATION following peer review. The definitive publisher-authenticated version JOURNAL OF LOGIC AND COMPUTATION (2018) 28(6): 1217-1242 is available online at: http://dx.doi.org/10.1093/logcom/exy003
主題
  • Other Ramsey's theorem for pairs
  • Other Size-change termination
  • Other Reverse Mathematics
  • Other Soundness
  • Other Well-ordering principles
内容注記
  • Other In this paper we continue the study, from Frittaion, Steila and Yokoyama (2017), on size-change termination in the context of Reverse Mathematics. We analyse the soundness of the SCT method. In particular, we prove that the statement ‘any programme which satisfies the combinatorial condition provided by the SCT criterion is terminating’ is equivalent to WO(ω_3) over RCA_0.
  • Other identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/16083
出版者 Oxford University Press
日付
    Issued2018-02-22
言語
  • eng
資源タイプ journal article
出版タイプ AM
資源識別子 URI http://hdl.handle.net/10119/16083
関連
  • isIdenticalTo DOI https://doi.org/10.1093/logcom/exy003
収録誌情報
    • ISSN 0955-792X
      • Journal of Logic and Computation
      • 巻28 号6 開始ページ1217 終了ページ1242
ファイル
コンテンツ更新日時 2021-04-14