Positive set theory

From Wikipedia, the free encyclopedia

In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension

  • "\{x \mid \phi\} exists"

holds for at least the positive formulas φ (the smallest class of formulas containing atomic membership and equality formulas and closed under conjunction, disjunction, existential and universal quantification).

Typically, the motivation for these theories is topological: the sets are the classes which are closed under a certain topology. The closure conditions for the various constructions allowed in building positive formulas are readily motivated (and one can further justify the use of universal quantifiers bounded in sets to get generalized positive comprehension): the justification of the existential quantifier seems to require that the topology be compact.

The set theory GPK^+_{\infty} of Olivier Esser consists of the following axioms:

  • The axiom of extensionality: x=y \Leftrightarrow\forall a\, (a\in x \Leftrightarrow a\in y).
  • The axiom of empty set: there exists a set \emptyset such that \neg \exists_x x\in\emptyset (this axiom can be neatly dispensed with if a false formula \perp is included as a positive formula).
  • The axiom of generalized positive comprehension: if φ is a formula in predicate logic using only \vee, \wedge, \exists, \forall, = , and \in, then the set of all x such that φ(x) is also a set. Quantification (\forall, \exists) may be bounded.
    • Note that negation is specifically not permitted.
  • The axiom of closure: for every formula φ(x), a set exists which is the intersection of all sets which contain every x such that φ(x); this is called the closure of \{x \mid \phi(x)\} and is written in any of the various ways that topological closures can be presented. This can be put more briefly if class language is allowed (any condition on sets defining a class as in NBG): for any class C there is a set which is the intersection of all sets which contain C as a subclass. This is obviously a reasonable principle if the sets are understood as closed classes in a topology.
  • The axiom of infinity: the von Neumann ordinal ω exists. This is not an axiom of infinity in the usual sense; if Infinity does not hold, the closure of ω exists and has itself as its sole additional member (it is certainly infinite); the point of this axiom is that ω contains no additional elements at all, which boosts the theory from the strength of second order arithmetic to the strength of Morse-Kelley set theory with the proper class ordinal a weakly compact cardinal.


  • The universal set is a proper set in this theory.
  • The sets of this theory are the collections of sets which are closed under a certain topology on the classes.
  • The theory can interpret ZFC (by restricting oneself to the class of well-founded sets, which is not itself a set). It in fact interprets a stronger theory (Morse-Kelley set theory with the proper class ordinal a weakly compact cardinal).

  • Isaac Malitz originally introduced Positive Set Theory in his 1976 PhD Thesis at UCLA
  • Alonzo Church was the chairman of the committee supervising the aforementioned thesis
  • Olivier Esser seems to be the most active in this field.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.