24 search results - page 1 / 5 » Automatic Generation of Classification Theorems for Finite A... |
CADE
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
JSYML
2000
13 years 4 months ago
2000
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-sem...
ATVA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
ACS
2006
13 years 4 months ago
2006
We give a coring version for the duality theorem for actions and coactions of a finitely generated projective Hopf algebra. We also provide a coring analogue for a theorem of H.-J....