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)

Categories

Keywords

Reprint years

DOI

10.2307/2687805

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A direct independence proof of Buchholz's Hydra Game on finite labeled trees.Masahiro Hamano & Mitsuhiro Okada - 1998 - Archive for Mathematical Logic 37 (2):67-89.
A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game.Masahiro Hamano & Mitsuhiro Okada - 1997 - Mathematical Logic Quarterly 43 (1):103-120.
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.
Definability in the h -quasiorder of labeled forests.Oleg V. Kudinov, Victor L. Selivanov & Anton V. Zhukov - 2009 - Annals of Pure and Applied Logic 159 (3):318-332.
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.
Review: Stephen G. Simpson, Nonprovability of Certain Combinatorial Properties of Finite Trees. [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
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.
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
Review: Wilfried Buchholz, Notation Systems for Infinitary Derivations ; Wilfried Buchholz, Explaining Gentzen's Consistency Proof within Infinitary Proof Theory ; Sergei Tupailo, Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
Analyzing Godel's T Via Expanded Head Reduction Trees.Arnold Beckmann & Andreas Weiermann - 2000 - Mathematical Logic Quarterly 46 (4):517-536.

Analytics

Added to PP
2017-02-22

Downloads
17 (#819,600)

6 months
5 (#544,079)

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