Paper Info
Title
A direct independence proof of Buchholz's Hydra Game on finite labeled trees
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 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.
Year
DOI
Venue
1998
10.1007/s001530050084
Arch. Math. Log.
Field
DocType
Volume
Discrete mathematics,Combinatorics,Lernaean Hydra,Corollary,Iterated function,Mathematics,Direct proof
Journal
37
Issue
ISSN
Citations 
2
0933-5846
3
PageRank 
References 
Authors
0.57
2
2
Name
Order
Citations
PageRank
Masahiro Hamano1397.66
Mitsuhiro Okada248853.23