On the public citation graph

Computing induction axioms

https://doi.org/10.1007/bfb0013076
0 signed · 22 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.1007/3-540-16780-3_132openalex-snapshot
The karlsruhe induction theorem proving system
inferredcites →https://doi.org/10.1007/3-540-52885-7_86openalex-snapshot
Term rewriting induction
inferredcites →https://doi.org/10.1007/3-540-55602-8_176openalex-snapshot
Disproving conjectures
inferredcites →https://doi.org/10.1007/bfb0012861openalex-snapshot
Argument-bounded algorithms as a basis for automated termination proofs
inferredcites →https://doi.org/10.1016/0004-3702(87)90017-8openalex-snapshot
Proof by consistency
inferredcites →https://doi.org/10.1016/0304-3975(79)90034-3openalex-snapshot
Mechanizing structural induction part I: Formal system
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferredcites →https://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions

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-58156-1_4openalex-snapshot
Lazy generation of induction hypotheses
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_70openalex-snapshot
Patching faulty conjectures
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_12openalex-snapshot
History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_23openalex-snapshot
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
inferred← citeshttps://doi.org/10.1007/bf01384232openalex-snapshot
Rule-based induction
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50013-9openalex-snapshot
Unification-Based Induction
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00096-xopenalex-snapshot
Proving theorems by reuse
inferred← citeshttps://doi.org/10.1017/s0960129505004822openalex-snapshot
Modelling general recursion in type theory
inferred← citeshttps://doi.org/10.1023/b:jars.0000021872.64036.41openalex-snapshot
Verification in the Classroom
inferred← citeshttps://doi.org/10.26083/tuprints-00001865openalex-snapshot
Verification of Second-Order Functional Programs
inferred← citeshttps://doi.org/10.29007/vbfpopenalex-snapshot
Rewriting and Inductive Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6226openalex-snapshot
Automation of Mathematical Induction as part of the History of Logic
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.