|
Vopěnka's Principle
In mathematics, Vopěnka's principle is a large cardinal axiom. The intuition behind the axiom is that the set-theoretical universe is so large that in every proper class, some members are similar to others, with this similarity formalized through elementary embeddings. Vopěnka's principle was first introduced by Petr Vopěnka and independently considered by H. Jerome Keisler, and was written up by . According to , Vopěnka's principle was originally intended as a joke: Vopěnka was apparently unenthusiastic about large cardinals and introduced his principle as a bogus large cardinal property, planning to show later that it was not consistent. However, before publishing his inconsistency proof he found a flaw in it. Definition Vopěnka's principle asserts that for every proper class Proper may refer to: Mathematics * Proper map, in topology, a property of continuous function between topological spaces, if inverse images of compact subsets are compact * Proper morphism, in al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ordinal Number
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by successively labeling each element with the least natural number that has not been previously used. To extend this process to various infinite sets, ordinal numbers are defined more generally as linearly ordered labels that include the natural numbers and have the property that every set of ordinals has a least element (this is needed for giving a meaning to "the least unused element"). This more general definition allows us to define an ordinal number \omega that is greater than every natural number, along with ordinal numbers \omega + 1, \omega + 2, etc., which are even greater than \omega. A linear order such that every subset has a least element is called a well-order. The axiom of choice implies that every set can be well-ordered, and given two well-ordered sets, one is isomo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ultrafilter (set Theory)
In the mathematical field of set theory, an ultrafilter is a ''maximal proper filter'': it is a filter U on a given non-empty set X which is a certain type of non-empty family of subsets of X, that is not equal to the power set \wp(X) of X (such filters are called ) and that is also "maximal" in that there does not exist any other proper filter on X that contains it as a proper subset. Said differently, a proper filter U is called an ultrafilter if there exists proper filter that contains it as a subset, that proper filter (necessarily) being U itself. More formally, an ultrafilter U on X is a proper filter that is also a maximal filter on X with respect to set inclusion, meaning that there does not exist any proper filter on X that contains U as a proper subset. Ultrafilters on sets are an important special instance of ultrafilters on partially ordered sets, where the partially ordered set consists of the power set \wp(X) and the partial order is subset inclusion \,\s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Huge Cardinal
In mathematics, a cardinal number κ is called huge if there exists an elementary embedding ''j'' : ''V'' → ''M'' from ''V'' into a transitive inner model ''M'' with critical point κ and :^M \subset M.\! Here, ''αM'' is the class of all sequences of length α whose elements are in M. Huge cardinals were introduced by . Variants In what follows, j''n'' refers to the ''n''-th iterate of the elementary embedding j, that is, j composed with itself ''n'' times, for a finite ordinal ''n''. Also, ''<αM'' is the class of all sequences of length less than α whose elements are in M. Notice that for the "super" versions, γ should be less than j(κ), not . κ is almost n-huge if and only if there is ''j'' : ''V'' → ''M'' with critical point κ and :^M \subset M.\! κ is super almost n-huge if and only if for every ordinal γ there is ''j'' : ''V'' → ''M'' with critical point κ, γ<j(κ), and :^M \subset M.\! κ is n-huge if and only if there is ''j'' : ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Extendible Cardinal
In mathematics, extendible cardinals are large cardinals introduced by , who was partly motivated by reflection principles. Intuitively, such a cardinal represents a point beyond which initial pieces of the universe of sets start to look similar, in the sense that each is elementarily embeddable into a later one. Definition For every ordinal ''η'', a cardinal κ is called η-extendible if for some ordinal ''λ'' there is a nontrivial elementary embedding ''j'' of ''V''κ+η into ''V''λ, where ''κ'' is the critical point of ''j'', and as usual ''Vα'' denotes the ''α''th level of the von Neumann hierarchy. A cardinal ''κ'' is called an extendible cardinal if it is ''η''-extendible for every nonzero ordinal ''η'' (Kanamori 2003). Variants and relation to other cardinals A cardinal ''κ'' is called ''η-C(n)''-extendible if there is an elementary embedding ''j'' witnessing that ''κ'' is ''η''-extendible (that is, ''j'' is elementary from ''Vκ+η'' to some ''Vλ'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Extendible Cardinal
In mathematics, extendible cardinals are large cardinals introduced by , who was partly motivated by reflection principles. Intuitively, such a cardinal represents a point beyond which initial pieces of the universe of sets start to look similar, in the sense that each is elementarily embeddable into a later one. Definition For every ordinal ''η'', a cardinal κ is called η-extendible if for some ordinal ''λ'' there is a nontrivial elementary embedding ''j'' of ''V''κ+η into ''V''λ, where ''κ'' is the critical point of ''j'', and as usual ''Vα'' denotes the ''α''th level of the von Neumann hierarchy. A cardinal ''κ'' is called an extendible cardinal if it is ''η''-extendible for every nonzero ordinal ''η'' (Kanamori 2003). Variants and relation to other cardinals A cardinal ''κ'' is called ''η-C(n)''-extendible if there is an elementary embedding ''j'' witnessing that ''κ'' is ''η''-extendible (that is, ''j'' is elementary from ''Vκ+η'' to some ''Vλ'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Accessible Category
The theory of accessible categories is a part of mathematics, specifically of category theory. It attempts to describe categories in terms of the "size" (a cardinal number) of the operations needed to generate their objects. The theory originates in the work of Grothendieck completed by 1969, and Gabriel and Ulmer (1971). It has been further developed in 1989 by Michael Makkai and Robert Paré, with motivation coming from model theory, a branch of mathematical logic. A standard text book by Adámek and Rosický appeared in 1994. Accessible categories also have applications in homotopy theory.J. RosickÃ"On combinatorial model categories" ''arXiv'', 16 August 2007. Retrieved on 19 January 2008.Rosický, J. "Injectivity and accessible categories." ''Cubo Matem. Educ'' 4 (2002): 201-211. Grothendieck continued the development of the theory for homotopy-theoretic purposes in his (still partly unpublished) 1991 manuscript ''Les dérivateurs''. Some properties of accessible categories dep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category (mathematics)
In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions. ''Category theory'' is a branch of mathematics that seeks to generalize all of mathematics in terms of categories, independent of what their objects and arrows represent. Virtually every branch of modern mathematics can be described in terms of categories, and doing so often reveals deep insights and similarities between seemingly different areas of mathematics. As such, category theory provides an alternative foundation for mathematics to set theory and other proposed axiomatic foundations. In general, the objects and arrows may be abstract entities of any kind, and the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Signature (logic)
In logic, especially mathematical logic, a signature lists and describes the non-logical symbols of a formal language. In universal algebra, a signature lists the operations that characterize an algebraic structure. In model theory, signatures are used for both purposes. They are rarely made explicit in more philosophical treatments of logic. Definition Formally, a (single-sorted) signature can be defined as a 4-tuple , where ''S''func and ''S''rel are disjoint sets not containing any other basic logical symbols, called respectively * ''function symbols'' (examples: +, ×, 0, 1), * ''relation symbols'' or ''predicates'' (examples: ≤, ∈), * ''constant symbols'' (examples: 0, 1), and a function ar: ''S''func \cup ''S''rel → \mathbb N which assigns a natural number called ''arity'' to every function or relation symbol. A function or relation symbol is called ''n''-ary if its arity is ''n''. Some authors define a nullary (0-ary) function symbol as ''constant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Cardinal
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct phil ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Definition In formal terms, a directed graph is an ordered pair where * ''V'' is a set whose elements are called '' vertices'', ''nodes'', or ''points''; * ''A'' is a set of ordered pairs of vertices, called ''arcs'', ''directed edges'' (sometimes simply ''edges'' with the corresponding set named ''E'' instead of ''A''), ''arrows'', or ''directed lines''. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called ''edges'', ''links'' or ''lines''. The aforementioned definition does not allow a directed graph to have multiple arrows with the same source and target nodes, but some authors consider a broader definition that allows directed graphs to have such multiple arcs (namely, they allow the arc set to be a m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inaccessible Cardinal
In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal is strongly inaccessible if it is uncountable, it is not a sum of fewer than cardinals smaller than , and \alpha < \kappa implies . The term "inaccessible cardinal" is ambiguous. Until about 1950, it meant "weakly inaccessible cardinal", but since then it usually means "strongly inaccessible cardinal". An uncountable cardinal is weakly inaccessible if it is a weak limit cardinal. It is strongly inaccessible, or just inaccessible, if it is a regular strong limit cardinal (this is equivalent to the definition given above). Some aut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
