On the public citation graph

Single axioms in the implicational propositional calculus

https://doi.org/10.1007/bfb0012869
0 signed · 19 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.2307/30067723openalex-snapshot
Proceedings of the Royal Irish Academy

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-52885-7_104openalex-snapshot
Perspectives on automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_109openalex-snapshot
Automated reasoning contributes to mathematics and logic
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_78openalex-snapshot
Partheo: A high-performance parallel theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-55038-0_10openalex-snapshot
Performance of competitive OR-parallelism
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-55425-4_9openalex-snapshot
Random competition: A simple, but efficient method for parallelizing inference systems
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_158openalex-snapshot
Cycle unification
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_167openalex-snapshot
Experiments in automated deduction with condensed detachment
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_213openalex-snapshot
ROO: A parallel theorem prover
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_4openalex-snapshot
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-21743-2_31openalex-snapshot
On Verified Automated Reasoning in Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_3openalex-snapshot
Generating Theorems by Generating Proof Structures
inferred← citeshttps://doi.org/10.1007/bf00263447openalex-snapshot
Exploitation of parallel processing for implementing high-performance deduction systems
inferred← citeshttps://doi.org/10.1007/bfb0013064openalex-snapshot
OR-parallel theorem proving with random competition
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50015-6openalex-snapshot
Parallel Automated Theorem Proving
inferred← citeshttps://doi.org/10.1023/a:1005806324129openalex-snapshot
The TPTP Problem Library
inferred← citeshttps://doi.org/10.1142/s2196888824500064openalex-snapshot
On Verified Automated Reasoning in Propositional Logic: Teaching Sequent Calculus to Computer Science Students
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.