On the public citation graph
Automatic generation of epsilon-delta proofs of continuity
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.
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/3-540-55602-8_220openalex-snapshot
Analytica — A theorem prover in mathematica
inferredcites →https://doi.org/10.1007/3-540-57826-9_134openalex-snapshot
Extending the HOL theorem prover with a computer algebra system to reason about the reals
inferredcites →https://doi.org/10.1007/978-1-4613-9647-5_25openalex-snapshot
Logic and Computation in MATHPERT: An Expert System for Learning Mathematics
inferredcites →https://doi.org/10.1007/978-3-7091-6461-7_9openalex-snapshot
Design principles of Mathpert: software to support education in algebra and calculus
inferredcites →https://doi.org/10.1007/bf02328447openalex-snapshot
Basic principles of mechanical theorem proving in elementary geometries
inferredcites →https://doi.org/10.1007/bfb0038693openalex-snapshot
Some applications of Gentzen's proof theory in automated deduction
inferredcites →https://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferredcites →https://doi.org/10.1016/s0747-7171(88)80008-7openalex-snapshot
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
inferredcites →https://doi.org/10.1090/conm/029/06openalex-snapshot
Some Automatic Proofs in Analysis
inferredcites →https://doi.org/10.1142/s0129054195000172openalex-snapshot
USING NONSTANDARD ANALYSIS TO ENSURE THE CORRECTNESS OF SYMBOLIC COMPUTATIONS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2000.0465openalex-snapshot
Automatic Derivation of the Irrationality of e
inferred← citeshttps://doi.org/10.1007/11829263_3openalex-snapshot
Reductio ad Absurdum: Planning Proofs by Contradiction
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_23openalex-snapshot
A Second-Order Theorem Prover Applied to Circumscription
inferred← citeshttps://doi.org/10.1007/978-3-030-28483-1_2openalex-snapshot
A Fully Automatic Theorem Prover with Human-Style Output
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_9openalex-snapshot
A Tactic Language for Declarative Proofs
inferred← citeshttps://doi.org/10.1007/978-3-662-05642-4_5openalex-snapshot
The Mechanization of Mathematics
inferred← citeshttps://doi.org/10.1007/s10817-004-2725-6openalex-snapshot
Constraint Solving for Proof Planning
inferred← citeshttps://doi.org/10.1007/s10817-016-9377-1openalex-snapshot
A Fully Automatic Theorem Prover with Human-Style Output
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80613-9openalex-snapshot
Automatic Derivation of the Irrationality of e
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
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.