In set theory, a semiset is a proper class that is a subclass of a set. In the typical foundations of Zermelo–Fraenkel set theory, semisets are impossible due to the axiom schema of specification. The theory of semisets was proposed and developed by Czech mathematicians Petr Vopěnka and Petr Hájek (1972). It is based on a modification of the von Neumann–Bernays–Gödel set theory; in standard NBG, the existence of semisets is precluded by the axiom of separation. The concept of semisets opens the way for a formulation of an alternative set theory. In particular, Vopěnka's Alternative Set Theory (1979) axiomatizes the concept of semiset, supplemented with several additional principles. Semisets can be used to represent sets with imprecise boundaries. Novák (1984) studied approximation of semisets by fuzzy sets, which are often more suitable for practical applications of the modeling of imprecision.
Vopěnka's alternative set theory Vopěnka's "Alternative Set Theory" builds on some ideas of the theory of semisets, but also introduces more radical changes: for example, all sets are "formally" finite, which means that sets in AST satisfy the law of mathematical induction for set-formulas (more precisely: the part of AST that consists of axioms related to sets only is equivalent to the Zermelo–Fraenkel (or ZF) set theory, in which the axiom of infinity is replaced by its negation). However, some of these sets contain subclasses that are not sets, which makes them different from Cantor (ZF) finite sets and they are called infinite in AST. The following axioms hold for sets.
Extensionality - Sets with the same elements are the same. Empty set: ∅ exists. Successor: For any sets x {\displaystyle x} and y {\displaystyle y} , x ∪ { y } {\displaystyle x\cup \{y\}} exists. Induction: Every formula ϕ {\displaystyle \phi } expressed in the language of sets only (all parameters are sets and all quantifiers are restricted to sets) and true of ∅ and true of x ∪ { y } {\displaystyle x\cup \{y\}} if it is true of x {\displaystyle x} is true of all sets. Regularity: Every set has an element disjoint from it. The following axioms hold for all classes.
Existence of classes: If ϕ ( x ) {\displaystyle \phi (x)} is any formula, then the class ϕ ( x ) {\displaystyle \phi (x)} of all sets x such that ϕ ( x ) {\displaystyle \phi (x)} exists. (The set x {\displaystyle x} is identified with the class of elements of x {\displaystyle x} .) Note that Kuratowski pairs of sets are sets, and so we can define (class) relations and functions on the universe of sets much as usual. Extensionality for classes: Classes with the same elements are equal. Axiom of proper semisets: There is a proper semiset. Prolongation axiom: Each countable function F can be extended to a set function. Axiom of extensional coding: Every collection of classes which is codable is extensionally codable. Vopenka considers representations of superclasses of classes using relations on sets. A class relation R on a class A is said to code the superclass of inverse images of elements of A under R. A class relation R on a class A is said to extensionally code this superclass if distinct elements of A have distinct preimages. Axiom of cardinalities: If two classes are uncountable, they are the same size.
References Vopěnka, P., and Hájek, P. The Theory of Semisets. Amsterdam: North-Holland, 1972. Vopěnka, P. Mathematics in the Alternative Set Theory. Teubner, Leipzig, 1979. Holmes, M.R. Alternative Axiomatic Set Theories, §9.2, Vopenka's alternative set theory. In E. N. Zalta (ed.): The Stanford Encyclopedia of Philosophy (Fall 2014 Edition). Novák, V. "Fuzzy sets—the approximation of semisets." Fuzzy Sets and Systems 14 (1984): 259–272. Proceedings of the 1st Symposium Mathematics in the Alternative Set Theory. JSMF, Bratislava, 1989.
