On the public citation graph
Single axioms for odd exponent groups
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.1007/bf00881862openalex-snapshot
Single axioms for groups and Abelian groups with various operations
inferredcites →https://doi.org/10.1007/bfb0013055openalex-snapshot
Application of automated deduction to the search for single axioms for exponent groups
inferredcites →https://doi.org/10.1016/0898-1221(94)00212-4openalex-snapshot
The shortest single axioms for groups of exponent 4
inferredcites →https://doi.org/10.1016/s0049-237x(08)70531-7openalex-snapshot
Equational Logic and Equational Theories of Algebras
inferredcites →https://doi.org/10.1017/s0004972700006912openalex-snapshot
Another single law for groups
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jabr.1996.0321openalex-snapshot
Quasigroups, Loops, and Associative Laws
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_100openalex-snapshot
Theorem proving with group presentations: Examples and questions
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_10openalex-snapshot
New Directions for Syntactic Termination Orderings
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_1openalex-snapshot
The Legacy of a Great Researcher
inferred← citeshttps://doi.org/10.1007/s00012-002-8205-0openalex-snapshot
A Generalization of Moufang and Steiner Loops
inferred← citeshttps://doi.org/10.1007/s00012-015-0323-6openalex-snapshot
Commutative idempotent groupoids and the constraint satisfaction problem
inferred← citeshttps://doi.org/10.1007/s00153-012-0276-9openalex-snapshot
A method for finding new sets of axioms for classes of semigroups
inferred← citeshttps://doi.org/10.1007/s10817-006-9044-zopenalex-snapshot
Searching for Shortest Single Axioms for Groups of Exponent 6
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103246openalex-snapshot
A formalised theorem in the partition calculus
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.01.018openalex-snapshot
Rectangular quasigroups and rectangular loops
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.016openalex-snapshot
Shortest single axioms for commutative moufang loops of exponent 3
inferred← citeshttps://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1080/00927870802278917openalex-snapshot
Primary Decompositions in Varieties of Commutative Diassociative Loops
inferred← citeshttps://doi.org/10.1090/s0002-9939-01-06090-7openalex-snapshot
Every diassociative A-loop is Moufang
inferred← citeshttps://doi.org/10.1090/s0002-9947-00-02350-3openalex-snapshot
The structure of conjugacy closed loops
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.2172/565657openalex-snapshot
Experiments with the hot list strategy
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0205078openalex-snapshot
A Spectrum of Applications of Automated Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.math/0409074openalex-snapshot
Rectangular loops and rectangular quasigroups
inferred← citeshttps://doi.org/10.48550/arxiv.math/0702874openalex-snapshot
Primary decompositions in varieties of commutative diassociative loops
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.