A direct independence proof of Buchholz's Hydra Game on finite labeled trees

Masahiro Hamano, Mitsuhiro Okada

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

We shall give a direct proof of the independence result of a Buchholz style-Hydra Game on labeled finite trees. We shall show that Takeuti-Arai's cut-elimination procedure of (Π11 - CA) + BI and of the iterated inductive definition systems can be directly expressed by the reduction rules of Buchholz's Hydra Game. As a direct corollary the independence result of the Hydra Game follows.

原文English
頁(從 - 到)67-89
頁數23
期刊Archive for Mathematical Logic
37
發行號2
DOIs
出版狀態Published - 1998 3月

All Science Journal Classification (ASJC) codes

  • 哲學
  • 邏輯

指紋

深入研究「A direct independence proof of Buchholz's Hydra Game on finite labeled trees」主題。共同形成了獨特的指紋。

引用此