Decidable sublanguages of set theory

In mathematical logic, various sublanguages of set theory are decidable.^[1][2] These include:

• Sets with monotone, additive, and multiplicative Functions.^[3]
• Sets with restricted quantifiers.^[4]