On the public citation graph
Equality in computer proof-assistants
0 signed · 55 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/jsco.2002.0551openalex-snapshot
Equality in Computer Algebra and Beyond
inferredcites →https://doi.org/10.1007/11618027_4openalex-snapshot
Translating Mathematical Vernacular into Knowledge Repositories
inferredcites →https://doi.org/10.1007/3-540-32370-8_15openalex-snapshot
On the Computer-Assisted Reasoning about Rough Sets
inferredcites →https://doi.org/10.1007/978-1-4615-2217-1_2openalex-snapshot
Introduction to Lattice Theory
inferredcites →https://doi.org/10.1007/978-3-031-40744-4_5openalex-snapshot
Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct
inferredcites →https://doi.org/10.1007/978-3-319-20615-8_17openalex-snapshot
Mizar: State-of-the-art and Beyond
inferredcites →https://doi.org/10.1007/978-3-540-27818-4_21openalex-snapshot
Improving Mizar Texts with Properties and Requirements
inferredcites →https://doi.org/10.1007/978-3-540-73451-2_17openalex-snapshot
Rough Set Theory from a Math-Assistant Perspective
inferredcites →https://doi.org/10.1007/978-3-642-02614-0_11openalex-snapshot
A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_5openalex-snapshot
A Brief Overview of Mizar
inferredcites →https://doi.org/10.1007/978-3-642-14128-7_12openalex-snapshot
Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar
inferredcites →https://doi.org/10.1007/s10817-012-9261-6openalex-snapshot
On Rewriting Rules in Mizar
inferredcites →https://doi.org/10.1007/s10817-012-9266-1openalex-snapshot
Custom Automations in Mizar
inferredcites →https://doi.org/10.1007/s10817-012-9267-0openalex-snapshot
Methods of Lemma Extraction in Natural Deduction Proofs
inferredcites →https://doi.org/10.1007/s10817-012-9268-zopenalex-snapshot
Formal Mathematics for Mathematicians
inferredcites →https://doi.org/10.1007/s10817-015-9331-7openalex-snapshot
Definitional Expansions in Mizar
inferredcites →https://doi.org/10.1007/s10817-015-9332-6openalex-snapshot
Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver
inferredcites →https://doi.org/10.1007/s10817-015-9333-5openalex-snapshot
Mechanizing Complemented Lattices Within Mizar Type System
inferredcites →https://doi.org/10.1007/s10817-015-9337-1openalex-snapshot
Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard
inferredcites →https://doi.org/10.1017/s0956796898213220openalex-snapshot
Haskell: The Craft of Functional Programming by Simon Thompson, Addison-Wesley, 1996. Miranda 81: The Craft of Functional Programming by Simon Thompson, Addison-Wesley, 1995.
inferredcites →https://doi.org/10.1023/a:1005843212881openalex-snapshot
Solution of the Robbins Problem
inferredcites →https://doi.org/10.1023/a:1006218513245openalex-snapshot
On Equivalents of Well-Foundedness
inferredcites →https://doi.org/10.15439/2014f183openalex-snapshot
Solving Systems of Polynomial Equations: a Novel End Condition and Root Computation Method
inferredcites →https://doi.org/10.15439/2014f387openalex-snapshot
Fuzzy Logic Rules Modeling Similarity-based Strict Equality
inferredcites →https://doi.org/10.2168/lmcs-10(3:23)2014openalex-snapshot
Improving legibility of natural deduction proofs is not trivial
inferredcites →https://doi.org/10.2478/forma-2014-0010openalex-snapshot
Topological Interpretation of Rough Sets
inferredcites →https://doi.org/10.3233/fi-2013-933openalex-snapshot
Automated Discovery of Properties of Rough Sets
inferredcites →https://doi.org/10.3233/fi-2014-1129openalex-snapshot
Efficient Rough Set Theory Merging
inferredcites →https://doi.org/10.5948/upo9781614445050.015openalex-snapshot
When is One Thing Equal to Some Other Thing?, Barry Mazur
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-030-41425-2_2openalex-snapshot
Refining Algebraic Hierarchy in Mathematical Repository of Mizar
inferred← citeshttps://doi.org/10.1007/978-3-030-41425-2_3openalex-snapshot
Extending Formal Topology in Mizar by Uniform Spaces
inferred← citeshttps://doi.org/10.1007/978-3-319-42547-4_6openalex-snapshot
Accessing the Mizar Library with a Weakly Strict Mizar Parser
inferred← citeshttps://doi.org/10.1007/978-3-319-67229-8_15openalex-snapshot
Towards Standardized Mizar Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-67229-8_16openalex-snapshot
Formalization of the Nominative Algorithmic Algebra in Mizar
inferred← citeshttps://doi.org/10.1007/978-3-319-76168-8_3openalex-snapshot
Extended Floyd-Hoare Logic over Relational Nominative Data
inferred← citeshttps://doi.org/10.1007/s10817-017-9440-6openalex-snapshot
The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar
inferred← citeshttps://doi.org/10.15439/2016f272openalex-snapshot
Modeling conflicts between legal rules
inferred← citeshttps://doi.org/10.15439/2016f290openalex-snapshot
Tarski's geometry modelled in Mizar computerized proof assistant
inferred← citeshttps://doi.org/10.15439/2016f520openalex-snapshot
On algebraic hierarchies in mathematical repository of Mizar
inferred← citeshttps://doi.org/10.15439/2017f289openalex-snapshot
Progress in the Independent Certification of Mizar Mathematical Library in Isabelle
inferred← citeshttps://doi.org/10.15439/2017f301openalex-snapshot
Formalization of the Algebra of Nominative Data in Mizar
inferred← citeshttps://doi.org/10.15439/2017f368openalex-snapshot
Introducing Euclidean Relations to Mizar
inferred← citeshttps://doi.org/10.15439/2017f553openalex-snapshot
Topological structures as a tool for formal modelling of rough sets
inferred← citeshttps://doi.org/10.15439/2018f88openalex-snapshot
Representation Matters: An Unexpected Property of Polynomial Rings and its Consequences for Formalizing Abstract Field Theory
inferred← citeshttps://doi.org/10.15439/978-83-922646-0-6openalex-snapshot
Position Papers of the 2017 Federated Conference on Computer Science and Information Systems
inferred← citeshttps://doi.org/10.2478/forma-2018-0017openalex-snapshot
On Two Alternative Axiomatizations of Lattices by McKenzie and Sholander
inferred← citeshttps://doi.org/10.2478/forma-2020-0019openalex-snapshot
Formalization of Quasilattices
inferred← citeshttps://doi.org/10.2478/forma-2021-0008openalex-snapshot
On Weakly Associative Lattices and Near Lattices
inferred← citeshttps://doi.org/10.2478/forma-2024-0022openalex-snapshot
Formalization of Trellises and Tolerance Relations
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.