Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
DOI10.1007/BF01630809zbMATH Open0691.03039OpenAlexW2065310207MaRDI QIDQ582289FDOQ582289
Authors: L. N. Gordeev 
Publication date: 1989
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01630809
Recommendations
- A Combinatorial Theorem for Trees
- Structure of a system of orthogonal projections connected with countable trees
- Trees, ordinals and termination
- On trees and tree dimension of ordered sets
- A REFINED ENUMERATION OF p-ARY LABELED TREES
- A bijection on ordered trees and its consequences
- New Computational Paradigms
- A REFINEMENT FOR ORDERED LABELED TREES
- Lattices of labelled ordered trees. II
- scientific article; zbMATH DE number 4023262
binary treesreverse mathematicswell-quasi-orderingD-functionsiterated inductive definitionsiterated projective ordinal notationslabelled treesVeblen-Bachmann-hierarchywell-ordering
Cites Work
- Proof theory. 2nd ed
- Title not available (Why is that?)
- Proof-theoretical analysis: Weak systems of functions and classes
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Eine Erweiterung T(V') des Ordinalzahlensystems \(C_{\Omega}(\Lambda _ 0)\) von G. Jäger. (An extension T(V') of the ordinal system \(C_{\Omega}(\Lambda _ 0)\) by G. Jäger)
- A new system of proof-theoretic ordinal functions
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- Majorisier Ungsrelationen und Fundamentalfolgen eines Ordinalzahlensystems von G. Jäger
- Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
Cited In (7)
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- Strong WQO Tree Theorems
- Well-partial-orderings and the big Veblen number
- Ordinal arithmetic with simultaneously defined theta-functions
- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
- A new system of proof-theoretic ordinal functions
This page was built for publication: Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582289)
