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

Masahiro Hamano, Mitsuhiro Okada

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)67-89
Number of pages23
JournalArchive for Mathematical Logic
Volume37
Issue number2
DOIs
Publication statusPublished - 1998 Mar

ASJC Scopus subject areas

  • Philosophy
  • Logic

Fingerprint Dive into the research topics of 'A direct independence proof of Buchholz's Hydra Game on finite labeled trees'. Together they form a unique fingerprint.

Cite this