Sets
A set is a structure A = (A) with no operations or relations defined on A.
Let A and B be sets. A morphism from A to B is a function h : A→B.
| Classtype | variety |
| Equational theory | decidable |
| Quasiequational theory | decidable |
| First-order theory | decidable |
| Locally finite | yes |
| Residual size | 2 |
| Congruence distributive | no |
| Congruence modular | no |
| Congruence n-permutable | no |
| Congruence regular | no |
| Congruence uniform | no |
| Congruence extension property | yes |
| Definable principal congruences | yes |
| Equationally definable principal congruences | no |
| Amalgamation property | yes |
| Strong amalgamation property | yes |
| Epimorphisms are surjective | yes |