Note on a proof of the extended Kirby-Paris theorem on labelled finite trees

DOI10.1016/S0195-6698(88)80016-7zbMath0657.05020MaRDI QIDQ1110524

Mitsuhiro Okada

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

games on treeslabelled finite trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (5)

Trees, ordinals and termination ⋮ A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game ⋮ Unnamed Item ⋮ A rationale for conditional equational programming ⋮ Unnamed Item

Cites Work

• Unnamed Item
• An accessibility proof of ordinal diagrams in intuitionistic theories for iterated inductive definitions
• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• A new system of proof-theoretic ordinal functions
• A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams
• Accessible Independence Results for Peano Arithmetic
• On the restricted ordinal theorem
• Proof theory

This page was built for publication: Note on a proof of the extended Kirby-Paris theorem on labelled finite trees