Archive for Mathematical Logic 37 (2):67-89 (1998)

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 $(\Pi^{1}_{1}-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.
Keywords Legacy
Categories (categorize this paper)
DOI 10.1007/s001530050084
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,029
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Archive for Mathematical Logic.Lev Gordeev - 2001 - Bulletin of Symbolic Logic 7 (4):534-535.

Add more citations

Similar books and articles

Generalizations of the Kruskal-Friedman Theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Worms, Gaps, and Hydras.Lorenzo Carlucci - 2005 - Mathematical Logic Quarterly 51 (4):342-350.
Simply Terminating Rewrite Systems with Long Derivations.Ingo Lepper - 2004 - Archive for Mathematical Logic 43 (1):1-18.


Added to PP index

Total views
40 ( #258,762 of 2,427,657 )

Recent downloads (6 months)
3 ( #233,270 of 2,427,657 )

How can I increase my downloads?


My notes