Misplaced Pages

Adequate pointclass

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions.

References

  1. Moschovakis, Y. N. (1987), Descriptive Set Theory, Studies in Logic and the Foundations of Mathematics, Elsevier, p. 158, ISBN 9780080963198.
  2. Gabbay, Dov M.; Kanamori, Akihiro; Woods, John (2012), Sets and Extensions in the Twentieth Century, Handbook of the History of Logic, vol. 6, Elsevier, p. 465, ISBN 9780080930664.


Stub icon

This set theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories:
Adequate pointclass Add topic