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]

References

Prefix: a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9

Portal di Ensiklopedia Dunia

Kembali kehalaman sebelumnya