On the public citation graph

Higman's lemma in type theory

https://doi.org/10.1007/bfb0097789
0 signed · 47 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.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
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/bf01211308openalex-snapshot
Inductive families
inferredcites →https://doi.org/10.1007/bf01699094openalex-snapshot
Ergebnisse eines mathematischen Kolloquiums
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/bfb0103100openalex-snapshot
Classically and intuitionistically provably recursive functions
inferredcites →https://doi.org/10.1016/0097-3165(72)90063-5openalex-snapshot
The theory of well-quasi-ordering: A frequently discovered concept
inferredcites →https://doi.org/10.1016/1385-7258(77)90067-1openalex-snapshot
Well-partial orderings and hierarchies
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0021-9800(69)80111-0openalex-snapshot
On free monoids partially ordered by embedding
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot
On well-quasi-ordering finite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1949-0032593-5openalex-snapshot
On Ordered Division Rings
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.1093/oso/9780198505242.001.0001openalex-snapshot
Elements of Intuitionism
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.287591openalex-snapshot
Verifying programs with unreliable channels
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state systems
inferredcites →https://doi.org/10.1111/j.1468-0149.1978.tb00089.xopenalex-snapshot
ELEMENTS OF INTUITIONISM
inferredcites →https://doi.org/10.1112/jlms/s2-47.2.193openalex-snapshot
Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.2307/2182503openalex-snapshot
Combinatory Logic, Volume I.
inferredcites →https://doi.org/10.2307/2274575openalex-snapshot
The independence of Peano's fourth axiom from Martin-Löf's type theory without universes
inferredcites →https://doi.org/10.2307/2274585openalex-snapshot
Ordinal numbers and the Hilbert basis theorem
inferredcites →https://doi.org/10.2307/2305141openalex-snapshot
4204
inferredcites →https://doi.org/10.2307/2306526openalex-snapshot
4358
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
inferredcites →https://doi.org/10.4153/cjm-1954-001-9openalex-snapshot
Points and Spaces

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45500-0_14openalex-snapshot
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_15openalex-snapshot
An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_12openalex-snapshot
A Mechanized Proof of Higman’s Lemma by Open Induction
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_12openalex-snapshot
Certified Kruskal’s Tree Theorem
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-24849-1_5openalex-snapshot
A Constructive Proof of Higman’s Lemma in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_17openalex-snapshot
Stop When You Are Almost-Full
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.1007/s10817-010-9178-xopenalex-snapshot
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.004openalex-snapshot
Programs from proofs using classical dependent choice
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00142-1openalex-snapshot
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
inferred← citeshttps://doi.org/10.1017/s0960129502003766openalex-snapshot
A proof-irrelevant model of Martin-Löf's logical framework
inferred← citeshttps://doi.org/10.1145/3779031.3779103openalex-snapshot
Bar Inductive Predicates for Constructive Algebra in Rocq
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:30)2017openalex-snapshot
A bound for Dickson's lemma
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.343openalex-snapshot
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
inferred← citeshttps://doi.org/10.48550/arxiv.1208.1366openalex-snapshot
A Locale for Minimal Bad Sequences
inferred← citeshttps://doi.org/10.5282/edoc.1619openalex-snapshot
On the Constructive Content of Proofs
inferred← citeshttps://doi.org/10.7146/brics.v5i39.19484openalex-snapshot
An Interpretation of the Fan Theorem in Type Theory
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.