On the public citation graph

Well-ordering of algebras and Kruskal's theorem

https://doi.org/10.1007/bfb0032399
0 signed · 49 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/aima.1993.1004openalex-snapshot
Well Quasi-Ordered Sets
inferredcites →https://doi.org/10.1007/3-540-54233-7_155openalex-snapshot
Satisfiability of systems of ordinal notations with the subterm property is decidable
inferredcites →https://doi.org/10.1007/3-540-56610-4openalex-snapshot
TAPSOFT'93: Theory and Practice of Software Development
inferredcites →https://doi.org/10.1007/3-540-56610-4_68openalex-snapshot
Trees, ordinals and termination
inferredcites →https://doi.org/10.1007/978-94-009-8399-1openalex-snapshot
Universal Algebra
inferredcites →https://doi.org/10.1007/bf01175640openalex-snapshot
Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse
inferredcites →https://doi.org/10.1007/bf01360719openalex-snapshot
An extension of Sch�tte's Klammersymbols
inferredcites →https://doi.org/10.1007/bf02007558openalex-snapshot
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
inferredcites →https://doi.org/10.1007/bfb0023857openalex-snapshot
Logical Foundations of Computer Science — Tver '92
inferredcites →https://doi.org/10.1007/bfb0023872openalex-snapshot
A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)
inferredcites →https://doi.org/10.1007/bfb0079544openalex-snapshot
Normalfunktionen und Konstruktive Systeme von Ordinalzahlen
inferredcites →https://doi.org/10.1007/bfb0091895openalex-snapshot
Inductive definitions and subsystems of analysis
inferredcites →https://doi.org/10.1016/0095-8956(90)90120-oopenalex-snapshot
Graph minors. IV. Tree-width and well-quasi-ordering
inferredcites →https://doi.org/10.1016/0168-0072(91)90022-eopenalex-snapshot
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
inferredcites →https://doi.org/10.1016/0168-0072(93)90192-gopenalex-snapshot
Proof-theoretic investigations on Kruskal's theorem
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/1385-7258(77)90067-1openalex-snapshot
Well-partial orderings and hierarchies
inferredcites →https://doi.org/10.1016/s0049-237x(08)70761-4openalex-snapshot
Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis
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(09)70156-9openalex-snapshot
Nonprovability of Certain Combinatorial Properties of Finite Trees
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7008-4openalex-snapshot
Harvey Friedman's Research on the Foundations of Mathematics
inferredcites →https://doi.org/10.1017/s0022481200031224openalex-snapshot
On the relation between choice and comprehension principles in second order arithmetic
inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot
On well-quasi-ordering finite trees
inferredcites →https://doi.org/10.1090/conm/065/891251openalex-snapshot
The metamathematics of the graph minor theorem
inferredcites →https://doi.org/10.1090/pspum/042/791071openalex-snapshot
Reverse mathematics
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.1109/lics.1988.5108openalex-snapshot
Proof-theoretic techniques for term rewriting theory
inferredcites →https://doi.org/10.1109/lics.1990.113752openalex-snapshot
A constructive proof of Higman's lemma
inferredcites →https://doi.org/10.1109/lics.1993.287573openalex-snapshot
The order types of termination orderings on monadic terms, strings and multisets
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.2307/2274585openalex-snapshot
Ordinal numbers and the Hilbert basis theorem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11894841_13openalex-snapshot
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_59openalex-snapshot
An analysis of divisibility orderings and recursive path orderings
inferred← citeshttps://doi.org/10.1007/978-3-031-47921-2_10openalex-snapshot
Well Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_11openalex-snapshot
Higman’s Lemma and Its Computational Content
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_48openalex-snapshot
Binary Trees and (Maximal) Order Types
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_35openalex-snapshot
Multiply-Recursive Upper Bounds with Higman’s Lemma
inferred← citeshttps://doi.org/10.1007/978-94-015-9757-9_21openalex-snapshot
Kruskal’s Tree Theorem in a Constructive Theory of Inductive Definitions
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.004openalex-snapshot
A comparison of well-known ordinal notation systems for ε0
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.004openalex-snapshot
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.010openalex-snapshot
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00349-2openalex-snapshot
Two applications of analytic functors
inferred← citeshttps://doi.org/10.1017/s1755020321000265openalex-snapshot
A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH
inferred← citeshttps://doi.org/10.1093/logcom/exad002openalex-snapshot
Normal functions and maximal order types
inferred← citeshttps://doi.org/10.1098/rsta.2022.0016openalex-snapshot
The uniform Kruskal theorem: between finite combinatorics and strong set existence
inferred← citeshttps://doi.org/10.1098/rsta.2022.0017openalex-snapshot
Some independence results related to finite trees
inferred← citeshttps://doi.org/10.4288/jafpos1956.9.95openalex-snapshot
The Trend of Logic and Foundation of Mathematics in Japan in 1991 to 1996
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:6)2022openalex-snapshot
Fusible numbers and Peano Arithmetic
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.