On the public citation graph

Searching for circles of pure proofs

https://doi.org/10.1007/bf00881802
0 signed · 26 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-55602-8_167openalex-snapshot
Experiments in automated deduction with condensed detachment
inferredcites →https://doi.org/10.1007/bf00245821openalex-snapshot
Meeting the challenge of fifty years of logic
inferredcites →https://doi.org/10.1007/bf01371632openalex-snapshot
Condensed detachment as a rule of inference
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/0098-3004(76)90046-7openalex-snapshot
Computers and Mathematics with Applications
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
inferredcites →https://doi.org/10.1305/ndjfl/1093887534openalex-snapshot
Shortest single axioms for the classical equivalential calculus.
inferredcites →https://doi.org/10.1305/ndjfl/1093888216openalex-snapshot
A shortest single axiom for the classical equivalential calculus.
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470996751.ch45openalex-snapshot
The Automation of Sound Reasoning and Successful Proof Finding
inferred← citeshttps://doi.org/10.1006/jsco.1999.0349openalex-snapshot
Proofs as Schemas and Their Heuristic Use
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_111openalex-snapshot
Experiments in the heuristic use of past proof experience
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_25openalex-snapshot
CODE: A powerful prover for problems of condensed detachment
inferred← citeshttps://doi.org/10.1007/bf00247668openalex-snapshot
The power of combining resonance with heat
inferred← citeshttps://doi.org/10.1007/bfb0023907openalex-snapshot
Flexible re-enactment of proofs
inferred← citeshttps://doi.org/10.1007/bfb0023908openalex-snapshot
Inference rights for controlling search in generating theorem provers
inferred← citeshttps://doi.org/10.1007/s10817-022-09620-8openalex-snapshot
Larry Wos: Visions of Automated Reasoning
inferred← citeshttps://doi.org/10.1023/a:1005731217123openalex-snapshot
Shortest Single Axioms for the Equivalential Calculus with CD and RCD
inferred← citeshttps://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1023/a:1005847113370openalex-snapshot
Automating the Search for Elegant Proofs
inferred← citeshttps://doi.org/10.1023/a:1005909914693openalex-snapshot
The Hot List Strategy
inferred← citeshttps://doi.org/10.1023/a:1020542009983openalex-snapshot
Short Single Axioms for Boolean Algebra
inferred← citeshttps://doi.org/10.1305/ndjfl/1074290715openalex-snapshot
Shortest Axiomatizations of Implicational S4 and S5
inferred← citeshttps://doi.org/10.2172/565657openalex-snapshot
Experiments with the hot list strategy
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.