A Computational Framework for Verifying Algebraic Structures
Abstract
This work presents a computational framework for verifying algebraicstructures such as magmas, semigroups, monoids, groups, and abelian groups.The framework algorithmically evaluates closure, associativity, identity,invertibility, and commutativity, and generates automated verificationreports. A functional dashboard implementation is provided to demonstratepractical verification and analysis of abstract algebraic systems.
Fields of Study & Subjects
semigroups and automata theory
Logic
programming
and type systems
Mathematical and Computational Methods
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 7 February 2026
- Language
- EN
- Document type
- Preprint