Girish Mahajan (Editor)

Decidable sublanguages of set theory

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematical logic, various sublanguages of set theory are decidable. These include:

  • Sets with Monotone, Additive, and Multiplicative Functions.
  • Sets with restricted quantifiers.

    • References

    Decidable sublanguages of set theory Wikipedia
    (Text) CC BY-SA


    Similar Topics