On the public citation graph
Redirecting Proofs by Contradiction
0 signed · 31 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.1006/jabr.1998.7467openalex-snapshot
Robbins Algebras Are Boolean: A Revision of McCune's Computer-Generated Solution of Robbins Problem
inferredcites →https://doi.org/10.1007/10721959_37openalex-snapshot
System Description: Tramp: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/3-540-61532-6_34openalex-snapshot
Translating machine-generated resolution proofs into ND-proofs at the assertion level
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_23openalex-snapshot
Analytic and Non-analytic Proofs
inferredcites →https://doi.org/10.1007/978-3-540-25984-8_15openalex-snapshot
System Description: E 0.81
inferredcites →https://doi.org/10.1007/978-3-540-74591-4_18openalex-snapshot
Source-Level Proof Reconstruction for Interactive Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_12openalex-snapshot
Ribbon Proofs for Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_49openalex-snapshot
System Description: E 1.8
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/s10817-012-9267-0openalex-snapshot
Methods of Lemma Extraction in Natural Deduction Proofs
inferredcites →https://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferredcites →https://doi.org/10.1016/j.entcs.2003.12.026openalex-snapshot
Assertion-level Proof Representation with Under-Specification
inferredcites →https://doi.org/10.1023/a:1005843212881openalex-snapshot
Solution of the Robbins Problem
inferredcites →https://doi.org/10.29007/36dtopenalex-snapshot
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers
inferredcites →https://doi.org/10.29007/tnfdopenalex-snapshot
Three Years of Experience with Sledgehammer, a Practical Link between Automatic and Interactive Theorem Provers
inferredcites →https://doi.org/10.29007/zbdbopenalex-snapshot
Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_27openalex-snapshot
Automated Improving of Proof Legibility in the Mizar System
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_28openalex-snapshot
A Vernacular for Coherent Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_21openalex-snapshot
Lemmatization for Stronger Reasoning in Large Theories
inferred← citeshttps://doi.org/10.1007/s10472-014-9443-5openalex-snapshot
Automated generation of machine verifiable and readable proofs: A case study of Tarski’s geometry
inferred← citeshttps://doi.org/10.1007/s10472-018-9597-7openalex-snapshot
From informal to formal proofs in Euclidean geometry
inferred← citeshttps://doi.org/10.1007/s10817-015-9335-3openalex-snapshot
Semi-intelligible Isar Proofs from Machine-Generated Proofs
inferred← citeshttps://doi.org/10.1145/3703595.3705877openalex-snapshot
Tactic Script Optimisation for Aesop
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:23)2014openalex-snapshot
Improving legibility of natural deduction proofs is not trivial
inferred← citeshttps://doi.org/10.29007/zbdbopenalex-snapshot
Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3391openalex-snapshot
A Vernacular for Coherent Logic
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.