Masahiro Hamano and Mitsuhiro Okada. A direct independence proof of Buchholz's Hydra game on finite labeled trees. Archive for mathematical logic, vol. 37 no. 2 , pp. 67–89 [Book Review]

Bulletin of Symbolic Logic 7 (4):534-535 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Worms, gaps, and hydras.Lorenzo Carlucci - 2005 - Mathematical Logic Quarterly 51 (4):342-350.
Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
Proof theory of iterated inductive definitions revisited.W. Buchholz - forthcoming - Archive for Mathematical Logic.
Induktive Definitionen und Dilatoren.Wilfried Buchholz - 1988 - Archive for Mathematical Logic 27 (1):51-60.
Forcing in Finite Structures.Domenico Zambella - 1997 - Mathematical Logic Quarterly 43 (3):401-412.
Labeled sequent calculi for modal logics and implicit contractions.Pierluigi Minari - 2013 - Archive for Mathematical Logic 52 (7-8):881-907.

Analytics

Added to PP
2013-11-21

Downloads
37 (#431,226)

6 months
8 (#361,431)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references