In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension
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
of Olivier Esser consists of the following axioms:
.
such that
(this axiom can be neatly dispensed with if a false formula
is included as a positive formula).
,
,
,
, = , and
, then the set of all x such that ϕ(x) is also a set. Quantification (
,
) may be bounded.
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.|
Contents
|
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)