On the public citation graph

Challenge problems in elementary calculus

https://doi.org/10.1007/bf00244493
0 signed · 35 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-10009-1_7openalex-snapshot
Variable elimination and chaining in a resolution-based prover for inequalities
inferredcites →https://doi.org/10.1016/0004-3702(85)90015-3openalex-snapshot
Completeness results for inequality provers

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11618027_10openalex-snapshot
Impasse-Driven Reasoning in Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_25openalex-snapshot
Proof Development with ΩMEGA: √2 Is Irrational
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_12openalex-snapshot
Proof Development with Ωmega
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_6openalex-snapshot
Experiments with Roo, a parallel automated deduction system
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_169openalex-snapshot
LIM+ challenge problems by RUE hyper-resolution
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_14openalex-snapshot
Semantically guided first-order theorem proving using hyper-linking
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_18openalex-snapshot
The TPTP problem library
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_32openalex-snapshot
Ordered chaining for total orderings
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferred← citeshttps://doi.org/10.1007/978-3-540-30221-6_2openalex-snapshot
Ωmega: Computer Supported Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-89408-7_17openalex-snapshot
ΩMEGA: Resource-Adaptive Processes in an Automated Reasoning System
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-94-011-3488-0_2openalex-snapshot
METEORs: High Performance Theorem Provers using Model Elimination
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_11openalex-snapshot
Proof Development with Ωmega: The Irrationality of $$\sqrt 2$$
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00881889openalex-snapshot
The rue theorem-proving system: The complete set of LIM+ challenge problems
inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot
METEOR: Exploring model elimination theorem proving
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bfb0013183openalex-snapshot
Distributed deduction by Clause-Diffusion: the aquarius prover
inferred← citeshttps://doi.org/10.1007/bfb0105418openalex-snapshot
Higher-order annotated terms for proof search
inferred← citeshttps://doi.org/10.1007/s10817-004-2725-6openalex-snapshot
Constraint Solving for Proof Planning
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.004openalex-snapshot
Failure Reasoning in Multiple-Strategy Proof Planning
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.006openalex-snapshot
Theorema: Towards computer-aided mathematical theory exploration
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.008openalex-snapshot
Computer supported mathematics with Ωmega
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferred← citeshttps://doi.org/10.1023/a:1005712718688openalex-snapshot
A Tribute to Woody Bledsoe
inferred← citeshttps://doi.org/10.1023/a:1005770705587openalex-snapshot
The Use of Lemmas in the Model Elimination Procedure
inferred← citeshttps://doi.org/10.1023/a:1005806324129openalex-snapshot
The TPTP Problem Library
inferred← citeshttps://doi.org/10.1023/a:1005843328643openalex-snapshot
The Heine–Borel Challenge Problem. In Honor of Woody Bledsoe
inferred← citeshttps://doi.org/10.1023/a:1005875128672openalex-snapshot
CLIN-S - A Semantically Guided First-Order Theorem Prover
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.