On the public citation graph
A mizar mode for HOL
0 signed · 80 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.1007/3-540-52885-7_114openalex-snapshot
Minimizing the number of clauses by renaming
inferredcites →https://doi.org/10.1007/3-540-52885-7_97openalex-snapshot
An examination of the prolog technology theorem-prover
inferredcites →https://doi.org/10.1007/3-540-57826-9_157openalex-snapshot
On the style of mechanical proving
inferredcites →https://doi.org/10.1007/3-540-60275-5_56openalex-snapshot
Automatically synthesized term denotation predicates: A proof aid
inferredcites →https://doi.org/10.1007/3-540-61377-3_38openalex-snapshot
Simultaneous rigid E-unification is undecidable
inferredcites →https://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferredcites →https://doi.org/10.1007/978-1-4612-3658-0_9openalex-snapshot
Automating Recursive Type Definitions in Higher Order Logic
inferredcites →https://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferredcites →https://doi.org/10.1007/bf02328452openalex-snapshot
Set theory in first-order logic: Clauses for Gödel's axioms
inferredcites →https://doi.org/10.1007/bfb0020908openalex-snapshot
On the Shape of Mathematical Arguments
inferredcites →https://doi.org/10.1016/0020-0190(87)90166-9openalex-snapshot
A deficiency of natural deduction
inferredcites →https://doi.org/10.1016/0167-6423(83)90008-4openalex-snapshot
A higher-order implementation of rewriting
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1017/s0960129598002680openalex-snapshot
Collections, sets and types
inferredcites →https://doi.org/10.1093/comjnl/38.2.91openalex-snapshot
Tracking design changes with formal machine-checked proof
inferredcites →https://doi.org/10.1093/logcom/3.1.47openalex-snapshot
Formalizing a Hierarchical Structure of Practical Mathematical Reasoning
inferredcites →https://doi.org/10.1109/hol.1991.596284openalex-snapshot
Integrating A First-order Automatic prover In The HOL Environment
inferredcites →https://doi.org/10.1109/hol.1991.596285openalex-snapshot
Window Inference In The HOL System
inferredcites →https://doi.org/10.1109/hol.1991.596299openalex-snapshot
A Package For Inductive Relation Definitions In HOL
inferredcites →https://doi.org/10.11575/prism/31335openalex-snapshot
OBJECT LANGUAGE EMBEDDING IN STANDARD ML OF NEW JERSEY
inferredcites →https://doi.org/10.48456/tr-337openalex-snapshot
Efficiency in a fully-expansive theorem prover
inferredcites →https://doi.org/10.6100/ir337809openalex-snapshot
On the shape of mathematical arguments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_1openalex-snapshot
High-Level Verification Using Theorem Proving and Formalized Mathematics
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_7openalex-snapshot
Calculational Reasoning Revisited An Isabelle/Isar Experience
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_12openalex-snapshot
Isar — A Generic Interpretative Approach to Readable Formal Proof Documents
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_13openalex-snapshot
On the Implementation of an Extensible Declarative Proof Language
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_14openalex-snapshot
Three Tactic Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_9openalex-snapshot
Traf: A Graphical Proof Tree Viewer Cooperating with Coq Through Proof General
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_36openalex-snapshot
The Isabelle/Naproche Natural Language Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-032-38214-6_5openalex-snapshot
Distilling Autoformalized Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-20615-8_17openalex-snapshot
Mizar: State-of-the-art and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_5openalex-snapshot
A Declarative Language for the Coq Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_2openalex-snapshot
Crafting a Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_13openalex-snapshot
Improving the Usability of HOL Through Controlled Automation Tactics
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_39openalex-snapshot
ATP Cross-Verification of the Mizar MPTP Challenge Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_5openalex-snapshot
A Brief Overview of Mizar
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_23openalex-snapshot
A Graphical Language for Proof Strategies
inferred← citeshttps://doi.org/10.1007/bfb0028384openalex-snapshot
Human-style theorem proving using PVS
inferred← citeshttps://doi.org/10.1007/s10817-009-9136-7openalex-snapshot
Declarative Representation of Proof Terms
inferred← citeshttps://doi.org/10.1007/s10817-014-9303-3openalex-snapshot
Learning-Assisted Automated Reasoning with Flyspeck
inferred← citeshttps://doi.org/10.1007/s10817-015-9337-1openalex-snapshot
Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard
inferred← citeshttps://doi.org/10.1007/s10817-018-9479-zopenalex-snapshot
Semantics of Mizar as an Isabelle Object Logic
inferred← citeshttps://doi.org/10.1007/s11786-008-0053-7openalex-snapshot
ATP-based Cross-Verification of Mizar Proofs: Method, Systems, and First Experiments
inferred← citeshttps://doi.org/10.1007/s12046-009-0001-5openalex-snapshot
Proof assistants: History, ideas and future
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.cl.2015.07.002openalex-snapshot
Flexary connectives in Mizar
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.014openalex-snapshot
Towards a Readable Formalisation of Category Theory
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.007openalex-snapshot
A proof-centric approach to mathematical assistants
inferred← citeshttps://doi.org/10.1023/a:1006086330571openalex-snapshot
Triple Dots in a Formal Language
inferred← citeshttps://doi.org/10.1023/a:1006218513245openalex-snapshot
On Equivalents of Well-Foundedness
inferred← citeshttps://doi.org/10.1023/a:1008712907154openalex-snapshot
Floating Point Verification in HOL Light: The Exponential Function
inferred← citeshttps://doi.org/10.1023/a:1021935419355openalex-snapshot
A Comparison of Mizar and Isar
inferred← citeshttps://doi.org/10.1109/lics.2003.1210044openalex-snapshot
Formal verification at Intel
inferred← citeshttps://doi.org/10.1109/tcad.2005.850814openalex-snapshot
An industrially effective environment for formal hardware verification
inferred← citeshttps://doi.org/10.1145/2854065.2854070openalex-snapshot
Towards a Mizar environment for Isabelle: foundations and language
inferred← citeshttps://doi.org/10.15439/2017f289openalex-snapshot
Progress in the Independent Certification of Mizar Mathematical Library in Isabelle
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:30)2012openalex-snapshot
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.48550/arxiv.1303.2975openalex-snapshot
Towards Automated Proof Strategy Generalisation
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05593openalex-snapshot
Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03028openalex-snapshot
A Survey on Theorem Provers in Formal Methods
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/3754openalex-snapshot
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/616openalex-snapshot
User interaction widgets for interactive theorem proving
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/917openalex-snapshot
Interactive theorem provers: issues faced as a user and tackled as a developer
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.