On the public citation graph
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-30229-0_13openalex-snapshot
Well-Partial Orderings and their Maximal Order Types
inferredcites →https://doi.org/10.1007/bf02007140openalex-snapshot
ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
inferredcites →https://doi.org/10.1007/bfb0079558openalex-snapshot
An upper bound for the provability of transfinite induction in systems with N-times iterated inductive definitions
inferredcites →https://doi.org/10.1007/bfb0091894openalex-snapshot
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies
inferredcites →https://doi.org/10.1016/0095-8956(72)90015-9openalex-snapshot
Wohlquasigeordnete Klassen endlicher Graphen
inferredcites →https://doi.org/10.1016/0168-0072(83)90012-xopenalex-snapshot
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
inferredcites →https://doi.org/10.1016/s0049-237x(08)71130-3openalex-snapshot
A Mathematical Incompleteness in Peano Arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71365-xopenalex-snapshot
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)71694-xopenalex-snapshot
Predicative Well-Orderings
inferredcites →https://doi.org/10.1016/s0049-237x(08)71815-9openalex-snapshot
On Logical Sentences in PA
inferredcites →https://doi.org/10.1016/s0049-237x(09)70514-2openalex-snapshot
Σ1 and Π1 Transfinite Induction
inferredcites →https://doi.org/10.1016/s0049-237x(09)70515-4openalex-snapshot
Set Theoretic Aspects of Atr0
inferredcites →https://doi.org/10.1017/s0022481200051410openalex-snapshot
Uniformly defined descending sequences of degrees
inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot
On well-quasi-ordering finite trees
inferredcites →https://doi.org/10.1017/s030500410005204xopenalex-snapshot
Well-quasi-orderings and sets of finite sequences
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0111704-1openalex-snapshot
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
inferredcites →https://doi.org/10.1112/blms/14.4.285openalex-snapshot
Accessible Independence Results for Peano Arithmetic
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1515/9781400871346openalex-snapshot
Two Applications of Logic to Mathematics
inferredcites →https://doi.org/10.2307/2273152openalex-snapshot
On the role of Ramsey quantifiers in first order arithmetic
inferredcites →https://doi.org/10.2307/2274131openalex-snapshot
Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
inferredcites →https://doi.org/10.2307/2274140openalex-snapshot
The strength of admissibility without foundation
inferredcites →https://doi.org/10.5282/ubm/epub.3840openalex-snapshot
Ein Ordinalzahlensystem für die beweistheoretische Abgrenzung der pi-1/2-Separation und Bar-Induktion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19900360204openalex-snapshot
A theorem on labelled trees and the limits of its provability
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_17openalex-snapshot
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_9openalex-snapshot
Goodstein’s Theorem Revisited
inferred← citeshttps://doi.org/10.1007/bf02007558openalex-snapshot
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
inferred← citeshttps://doi.org/10.1007/s11229-004-6208-4openalex-snapshot
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90052-7openalex-snapshot
A new system of proof-theoretic ordinal functions
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90078-9openalex-snapshot
An independence result for (II11-CA)+BI
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80049-9openalex-snapshot
Chapter 16 A survey of recursive combinatorics
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferred← citeshttps://doi.org/10.1017/jsl.2016.17openalex-snapshot
REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
inferred← citeshttps://doi.org/10.1070/rm2010v065n05abeh004703openalex-snapshot
Gödel incompleteness theorems and the limits of their applicability. I
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0932450-9openalex-snapshot
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
inferred← citeshttps://doi.org/10.2307/2273851openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic, Hull, 1986
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.4213/rm9378openalex-snapshot
Теоремы Гeделя о неполноте и границы их применимости. I
inferred← citeshttps://doi.org/10.48550/arxiv.2005.04951openalex-snapshot
Formal Mathematical Systems including a Structural Induction Principle
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.