Class logic is a logic in its broad sense, whose objects are called classes. In a narrower sense, one speaks of a class logic only if classes are described by a property of their elements. This class logic is thus a generalization of set theory, which allows only a limited consideration of classes.
The first class logic in the strict sense was created by Giuseppe Peano in 1889 as the basis for his arithmetic (Peano Axioms). He introduced the class term, which formally correctly describes classes through a property of their elements. Today the class term is denoted in the form {x|A(x)}, where A(x) is an arbitrary statement, which all class members x meet. Peano axiomatized the class term for the first time and used it fully. Gottlob Frege also tried establishing the arithmetic logic with class terms in 1893; Bertrand Russell discovered a conflict in it in 1902 which became known as Russell's paradox. As a result, it became generally known that you can not safely use class terms.
To solve the problem, Russell developed his type theory from 1903 to 1908, which allowed only a restricted use of class terms. Among mathematicians, Russell's type theory was superseded by an alternative axiomatization of set theory initiated by Ernst Zermelo [ clarification needed ]. This axiomatization is not a class logic in the narrower sense, because in its present form (Zermelo-Fraenkel or NBG) it does not axiomatize the class term, but uses it only in practice as a useful notation. Willard Van Orman Quine described a set theory New Foundations (NF) in 1937, based on a theory of types which was intended as an alternative to Zermelo-Fraenkel. In 1940 Quine advanced NF to Mathematical Logic (ML). Since the antinomy of Burali-Forti was derived in the first version of ML, [1] Quine clarified ML, retaining the widespread use of classes, and took up a proposal by Hao Wang [2] introducing in 1963 in his theory of {x|A(x)} as a virtual class, so that classes are although not yet full-fledged terms, but sub-terms in defined contexts. [3]
After Quine, Arnold Oberschelp developed the first fully functional modern axiomatic class logic starting in 1974. It is a consistent extension of predicate logic and allows the unrestricted use of class terms (such as Peano). [4] It uses all classes that produce antinomies of naive set theory as a term. This is possible because the theory assumes no existence axioms for classes. It presupposes in particular any number of axioms, but can also take those and syntactically correct to formulate in the traditionally simple design with class terms. For example, the Oberschelp set theory developed the Zermelo–Fraenkel set theory within the framework of class logic. [5] Three principles guarantee that cumbersome ZF formulas are translatable into convenient classes formulas; guarantee a class logical increase in the ZF language they form without quantities axioms together with the axioms of predicate logic an axiom system for a simple logic of general class. [6]
The principle of abstraction (Abstraktionsprinzip) states that classes describe their elements via a logical property:
The principle of extensionality (Extensionalitätsprinzip ) describes the equality of classes by matching their elements and eliminates the axiom of extensionality in ZF:
The principle of comprehension (Komprehensionsprinzip) determines the existence of a class as an element:
In mathematics, the axiom of regularity is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads:
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics.
In set theory and its applications throughout mathematics, a class is a collection of sets that can be unambiguously defined by a property that all its members share. Classes act as a way to have set-like collections while differing from sets so as to avoid paradoxes, especially Russell's paradox. The precise definition of "class" depends on foundational context. In work on Zermelo–Fraenkel set theory, the notion of class is informal, whereas other set theories, such as von Neumann–Bernays–Gödel set theory, axiomatize the notion of "proper class", e.g., as entities that are not members of another entity.
In mathematical logic, Russell's paradox is a set-theoretic paradox published by the British philosopher and mathematician Bertrand Russell in 1901. Russell's paradox shows that every set theory that contains an unrestricted comprehension principle leads to contradictions. According to the unrestricted comprehension principle, for any sufficiently well-defined property, there is the set of all and only the objects that have that property. Let R be the set of all sets that are not members of themselves. If R is not a member of itself, then its definition entails that it is a member of itself; yet, if it is a member of itself, then it is not a member of itself, since it is the set of all sets that are not members of themselves. The resulting contradiction is Russell's paradox. In symbols:
The axiom of extensionality, also called the axiom of extent, is an axiom used in many forms of axiomatic set theory, such as Zermelo–Fraenkel set theory. The axiom defines what a set is. Informally, the axiom means that the two sets A and B are equal if and only if A and B have the same members.
In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo–Fraenkel set theory. It was introduced by Zermelo (1908) as a special case of his axiom of elementary sets.
In many popular versions of axiomatic set theory, the axiom schema of specification, also known as the axiom schema of separation (Aussonderungsaxiom), subset axiom, axiom of class construction, or axiom schema of restricted comprehension is an axiom schema. Essentially, it says that any definable subclass of a set is a set.
In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite sets in ZF.
In mathematics, equality is a relationship between two quantities or expressions, stating that they have the same value, or represent the same mathematical object. Equality between A and B is written A = B, and pronounced "A equals B". In this equality, A and B are distinguished by calling them left-hand side (LHS), and right-hand side (RHS). Two objects that are not equal are said to be distinct.
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.
In mathematics and logic, an axiomatic system is any collection of primitive notions and axioms to logically derive theorems. A theory is a consistent, relatively-self-contained body of knowledge which usually contains an axiomatic system and all its derived theorems. An axiomatic system that is completely described is a special kind of formal system. A formal theory is an axiomatic system that describes a set of sentences that is closed under logical implication. A formal proof is a complete rendition of a mathematical proof within a formal system.
In set theory, a universal set is a set which contains all objects, including itself. In set theory as usually formulated, it can be proven in multiple ways that a universal set does not exist. However, some non-standard variants of set theory include a universal set.
In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by V, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930.
In set theory, a branch of mathematics, an urelement or ur-element is an object that is not a set, but that may be an element of a set. It is also referred to as an atom or individual. Ur-elements are also not identical with the empty set.
In mathematical logic, New Foundations (NF) is a non-well-founded, finitely axiomatizable set theory conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica.
In set theory, the axiom of limitation of size was proposed by John von Neumann in his 1925 axiom system for sets and classes. It formalizes the limitation of size principle, which avoids the paradoxes encountered in earlier formulations of set theory by recognizing that some classes are too big to be sets. Von Neumann realized that the paradoxes are caused by permitting these big classes to be members of a class. A class that is a member of a class is a set; a class that is not a set is a proper class. Every class is a subclass of V, the class of all sets. The axiom of limitation of size says that a class is a set if and only if it is smaller than V—that is, there is no function mapping it onto V. Usually, this axiom is stated in the equivalent form: A class is a proper class if and only if there is a function that maps it onto V.
An approach to the foundations of mathematics that is of relatively recent origin, Scott–Potter set theory is a collection of nested axiomatic set theories set out by the philosopher Michael Potter, building on earlier work by the mathematician Dana Scott and the philosopher George Boolos.
In mathematics and logic, Ackermann set theory is an axiomatic set theory proposed by Wilhelm Ackermann in 1956.
The mathematical concept of a function dates from the 17th century in connection with the development of calculus; for example, the slope of a graph at a point was regarded as a function of the x-coordinate of the point. Functions were not explicitly considered in antiquity, but some precursors of the concept can perhaps be seen in the work of medieval philosophers and mathematicians such as Oresme.
Arnold Oberschelp was a German mathematician and logician. He was for many years professor of logic and science in Kiel.