Automated theorem proving in quasigroup and loop theory
From MaRDI portal
(Redirected from Publication:3568233)
Recommendations
- Short identities implying a quasigroup is a loop or group.
- Classification results in quasigroup and loop theory via a combination of automated reasoning tools.
- Quasigroups, loops, and associative laws
- Some experiments in nonassociative ring theory with an automated theorem prover
- Loops with abelian inner mapping groups: an application of automated deduction
Cited in
(15)- Automated reasoning and exhaustive search: Quasigroup existence problems
- Quasigroups, loops, and associative laws
- Guiding an automated theorem prover with neural rewriting
- From informal to formal proofs in Euclidean geometry
- Lemmatization for stronger reasoning in large theories
- Classification results in quasigroup and loop theory via a combination of automated reasoning tools.
- scientific article; zbMATH DE number 4051903 (Why is no real title available?)
- scientific article; zbMATH DE number 1985200 (Why is no real title available?)
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- Loops with abelian inner mapping groups: an application of automated deduction
- Automated Reasoning
- Short identities implying a quasigroup is a loop or group.
- Identities and generalized derivatives of quasigroups
- Automated reasoning for mathematics
- Automatic construction and verification of isotopy invariants
This page was built for publication: Automated theorem proving in quasigroup and loop theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568233)
