On the public citation graph

A case study in automated theorem proving: Finding sages in combinatory logic

https://doi.org/10.1007/bf00381147
0 signed · 17 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/bf00248251openalex-snapshot
A foray into combinatory logic
inferredcites →https://doi.org/10.1016/0004-3702(84)90054-7openalex-snapshot
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications

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-63104-6_42openalex-snapshot
Evolving combinators
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_13openalex-snapshot
The Flowering of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_15openalex-snapshot
Automated Reasoning and Bledsoe’s Dream for the Field
inferred← citeshttps://doi.org/10.1007/bf00244514openalex-snapshot
The problem of finding a strategy to control binary paramodulation
inferred← citeshttps://doi.org/10.1007/bf00247439openalex-snapshot
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
inferred← citeshttps://doi.org/10.1007/bf00881795openalex-snapshot
The kernel strategy and its use for the study of combinatory logic
inferred← citeshttps://doi.org/10.1007/bf00881872openalex-snapshot
Automated proofs of equality problems in Overbeek's competition
inferred← citeshttps://doi.org/10.1007/bf01543481openalex-snapshot
The application of automated reasoning to questions in mathematics and logic
inferred← citeshttps://doi.org/10.1007/bfb0012821openalex-snapshot
Elements of Z-module reasoning
inferred← citeshttps://doi.org/10.1007/s10817-022-09620-8openalex-snapshot
Larry Wos: Visions of Automated Reasoning
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90034-yopenalex-snapshot
The absence and the presence of fixed point combinators
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot
Automated theorem proving and logic programming: a natural symbiosis
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.32408/compositionality-5-8openalex-snapshot
Substructural fixed-point theorems and the diagonal argument: theme and variations
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.