Top Qs

Timeline

Chat

Perspective

Decidable sublanguages of set theory

From Wikipedia, the free encyclopedia

Remove ads

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]

The topic of this article may not meet Wikipedia's general notability guideline. (May 2021)

References

Loading content...

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads