A Direct Independence Proof of Buchholz's Hydra Game on Finite Labeled Trees

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: 92,907

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.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
A slow growing analogue to buchholz' proof.Toshiyasu Arai - 1991 - Annals of Pure and Applied Logic 54 (2):101-120.
Forcing in Finite Structures.Domenico Zambella - 1997 - Mathematical Logic Quarterly 43 (3):401-412.
Proof and refutation in MALL as a game.Olivier Delande, Dale Miller & Alexis Saurin - 2010 - Annals of Pure and Applied Logic 161 (5):654-672.
Linguistics, Logic and Finite Trees.Patrick Blackburn & Wilfried Meyer-Viol - 1994 - Logic Journal of the IGPL 2 (1):3-29.

Analytics

Added to PP
2017-02-22

Downloads
18 (#855,749)

6 months
6 (#582,229)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references