On the public citation graph
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
0 signed · 25 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-16780-3_95openalex-snapshot
ECR: An equality conditional resolution proof procedure
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_15openalex-snapshot
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering that x 3 = x Implies Ring Commutativity
inferredcites →https://doi.org/10.1007/978-1-4612-9872-4openalex-snapshot
Lectures in Abstract Algebra
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00381147openalex-snapshot
A case study in automated theorem proving: Finding sages in combinatory logic
inferredcites →https://doi.org/10.1007/bfb0000049openalex-snapshot
Solving open questions with an automated theorem-proving program
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.5555/800129.804214openalex-snapshot
Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra
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-51081-8_129openalex-snapshot
Consider only general superpositions in completion procedures
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_4openalex-snapshot
A case study of completion modulo distributivity and Abelian groups
inferred← citeshttps://doi.org/10.1007/bf00243001openalex-snapshot
Solving open problems in right alternative rings with Z-module reasoning
inferred← citeshttps://doi.org/10.1007/bf00252178openalex-snapshot
Using hints to increase the effectiveness of an automated reasoning program: Case studies
inferred← citeshttps://doi.org/10.1007/bf00302643openalex-snapshot
Automated proofs of the moufang identities in alternative rings
inferred← citeshttps://doi.org/10.1007/bf00881872openalex-snapshot
Automated proofs of equality problems in Overbeek's competition
inferred← citeshttps://doi.org/10.1007/bf02090774openalex-snapshot
Unnecessary inferences in associative-commutative completion procedures
inferred← citeshttps://doi.org/10.1007/bfb0012871openalex-snapshot
Challenge problems from nonassociative rings for theorem provers
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00218-aopenalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80020-xopenalex-snapshot
Automated proof of ring commutativity problems by algebraic methods
inferred← citeshttps://doi.org/10.1109/secon.2000.845585openalex-snapshot
Z-module reasoning and proving the commutativity of rings of exponent n≥2
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.