Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Universal set
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Restricted comprehension=== There are set theories known to be [[consistent]] (if the usual set theory is consistent) in which the universal set {{mvar|V}} does exist (and <math>V \in V</math> is true). In these theories, Zermelo's [[axiom of comprehension]] does not hold in general, and the axiom of comprehension of [[naive set theory]] is restricted in a different way. A set theory containing a universal set is necessarily a [[non-well-founded set theory]]. The most widely studied set theory with a universal set is [[Willard Van Orman Quine]]'s [[New Foundations]]. [[Alonzo Church]] and [[Arnold Oberschelp]] also published work on such set theories. Church speculated that his theory might be extended in a manner consistent with Quine's,<ref>{{harvtxt|Church|1974|p=308}}. See also {{harvtxt|Forster|1995|p=136}}, {{harvtxt|Forster|2001|p=17}}, and {{harvtxt|Sheridan|2016}}.</ref> but this is not possible for Oberschelp's, since in it the singleton function is provably a set,{{sfnp|Oberschelp|1973|p=40}} which leads immediately to paradox in New Foundations.{{sfnp|Holmes|1998|p=110}} Another example is [[positive set theory]], where the axiom of comprehension is restricted to hold only for the [[positive formula]]s (formulas that do not contain negations). Such set theories are motivated by notions of closure in topology.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)