|
Shrewd Cardinal
In mathematics, a shrewd cardinal is a certain kind of large cardinal number introduced by , extending the definition of indescribable cardinals. For an ordinal λ, a cardinal number κ is called λ-shrewd if for every proposition φ, and set A ⊆ Vκ with (Vκ+λ, ∈, A) ⊧ φ there exists an α, λ' κ). This definition extends the concept of indescribability to transfinite levels. A λ-shrewd cardinal is also μ-shrewd for any ordinal μ < λ.(Corollary 4.3) Shrewdness was developed by as part of his of Π12-comprehension [...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 points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Second-order Arithmetic
In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics. A precursor to second-order arithmetic that involves third-order parameters was introduced by David Hilbert and Paul Bernays in their book ''Grundlagen der Mathematik''. The standard axiomatization of second-order arithmetic is denoted by Z2. Second-order arithmetic includes, but is significantly stronger than, its first-order counterpart Peano arithmetic. Unlike Peano arithmetic, second-order arithmetic allows quantification over sets of natural numbers as well as numbers themselves. Because real numbers can be represented as (infinite) sets of natural numbers in well-known ways, and because second-order arithmetic allows quantification over such sets, it is possible to formalize the real numbers in second-order arithmetic. For this reason, secon ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stationary Set
In mathematics, specifically set theory and model theory, a stationary set is a set that is not too small in the sense that it intersects all club sets, and is analogous to a set of non-zero measure in measure theory. There are at least three closely related notions of stationary set, depending on whether one is looking at subsets of an ordinal, or subsets of something of given cardinality, or a powerset. Classical notion If \kappa is a cardinal of uncountable cofinality, S \subseteq \kappa, and S intersects every club set in \kappa, then S is called a stationary set.Jech (2003) p.91 If a set is not stationary, then it is called a thin set. This notion should not be confused with the notion of a thin set in number theory. If S is a stationary set and C is a club set, then their intersection S \cap C is also stationary. This is because if D is any club set, then C \cap D is a club set, thus (S \cap C) \cap D = S \cap (C \cap D) is non empty. Therefore, (S \cap C) must be stati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subtle Cardinal
In mathematics, subtle cardinals and ethereal cardinals are closely related kinds of large cardinal number. A cardinal ''κ'' is called subtle if for every closed and unbounded ''C'' ⊂ ''κ'' and for every sequence ''A'' of length ''κ'' for which element number ''δ'' (for an arbitrary ''δ''), ''A''''δ'' ⊂ ''δ'', there exist ''α'', ''β'', belonging to ''C'', with ''α'' < ''β'', such that ''A''''α'' = ''A''''β'' ∩ ''α''. A cardinal ''κ'' is called ethereal if for every closed and unbounded ''C'' ⊂ ''κ'' and for every sequence ''A'' of length ''κ'' for which element number ''δ'' (for an arbitrary ''δ''), ''A''''δ'' ⊂ ''δ'' and ''A''''δ'' has the same cardinal as ''δ'', there exist ''α'', ''β'', belonging to ''C'', with ''α'' < ''β'', such that card(''α'') = card(''A''''β'' ∩& ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantification (science)
In mathematics and empirical science, quantification (or quantitation) is the act of counting and measuring that maps human sense observations and experiences into quantity, quantities. Quantification in this sense is fundamental to the scientific method. Natural science Some measure of the undisputed general importance of quantification in the natural sciences can be gleaned from the following comments: * "these are mere facts, but they are quantitative facts and the basis of science." * It seems to be held as universally true that "the foundation of quantification is measurement." * There is little doubt that "quantification provided a basis for the objectivity of science." * In ancient times, "musicians and artists ... rejected quantification, but merchants, by definition, quantified their affairs, in order to survive, made them visible on parchment and paper." * Any reasonable "comparison between Aristotle and Galileo shows clearly that there can be no unique lawfulness discov ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lévy Hierarchy
In set theory and mathematical logic, the Lévy hierarchy, introduced by Azriel Lévy in 1965, is a hierarchy of formulas in the formal language of the Zermelo–Fraenkel set theory, which is typically called just the language of set theory. This is analogous to the arithmetical hierarchy, which provides a similar classification for sentences of the language of arithmetic. Definitions In the language of set theory, atomic formulas are of the form x = y or x ∈ y, standing for equality and set membership predicates, respectively. The first level of the Lévy hierarchy is defined as containing only formulas with no unbounded quantifiers, and is denoted by \Delta _0=\Sigma_0=\Pi_0.Walicki, Michal (2012). ''Mathematical Logic'', p. 225. World Scientific Publishing Co. Pte. Ltd. The next levels are given by finding an equivalent formula in prenex normal form, and counting the number of changes of quantifiers: In the theory ZFC, a formula A is called: \Sigma _ if A is equivalent ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Admissible Ordinal
In set theory, an ordinal number ''α'' is an admissible ordinal if L''α'' is an admissible set (that is, a transitive model of Kripke–Platek set theory); in other words, ''α'' is admissible when ''α'' is a limit ordinal and L''α'' ⊧ Σ0-collection.. See in particulap. 265. The term was coined by Richard Platek in 1966. The first two admissible ordinals are ω and \omega_1^ (the least non-recursive ordinal, also called the Church–Kleene ordinal). Any regular uncountable cardinal is an admissible ordinal. By a theorem of Sacks, the countable admissible ordinals are exactly those constructed in a manner similar to the Church–Kleene ordinal, but for Turing machines with oracles. One sometimes writes \omega_\alpha^ for the \alpha-th ordinal that is either admissible or a limit of admissibles; an ordinal that is both is called ''recursively inaccessible''. There exists a theory of large ordinals in this manner that is highly parallel to that of (small) large c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stable Ordinal
A stable is a building in which livestock, especially horses, are kept. It most commonly means a building that is divided into separate stalls for individual animals and livestock. There are many different types of stables in use today; the American-style barn, for instance, is a large barn with a door at each end and individual stalls inside or free-standing stables with top and bottom-opening doors. The term "stable" is also used to describe a group of animals kept by one owner, regardless of housing or location. The exterior design of a stable can vary widely, based on climate, building materials, historical period and cultural styles of architecture. A wide range of building materials can be used, including masonry (bricks or stone), wood and steel. Stables also range widely in size, from a small building housing one or two animals to facilities at agricultural shows or race tracks that can house hundreds of animals. History The stable is typically historically the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ordinal Analysis
In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. If theories have the same proof-theoretic ordinal they are often equiconsistent, and if one theory has a larger proof-theoretic ordinal than another it can often prove the consistency of the second theory. History The field of ordinal analysis was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that the proof-theoretic ordinal of Peano arithmetic is ε0. See Gentzen's consistency proof. Definition Ordinal analysis concerns true, effective (recursive) theories that can interpret a sufficient portion of arithmetic to make statements about ordinal notations. The proof-theoretic ordinal of such a theory T is the supremum of the order types of all ordinal notations (necessarily recursive, see next section) that the theory can prove are well founded—the supremum of all ordinals \alpha for which the ... [...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 philo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michael Rathjen
Michael may refer to: People * Michael (given name), a given name * Michael (surname), including a list of people with the surname Michael Given name "Michael" * Michael (archangel), ''first'' of God's archangels in the Jewish, Christian and Islamic religions * Michael (bishop elect), English 13th-century Bishop of Hereford elect * Michael (Khoroshy) (1885–1977), cleric of the Ukrainian Orthodox Church of Canada * Michael Donnellan (1915–1985), Irish-born London fashion designer, often referred to simply as "Michael" * Michael (footballer, born 1982), Brazilian footballer * Michael (footballer, born 1983), Brazilian footballer * Michael (footballer, born 1993), Brazilian footballer * Michael (footballer, born February 1996), Brazilian footballer * Michael (footballer, born March 1996), Brazilian footballer * Michael (footballer, born 1999), Brazilian footballer Rulers =Byzantine emperors= *Michael I Rangabe (d. 844), married the daughter of Emperor Nikephoros I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Totally Indescribable Cardinal
In mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language ''Q''. There are many different types of indescribable cardinals corresponding to different choices of languages ''Q''. They were introduced by . A cardinal number κ is called Π-indescribable if for every Πm proposition φ, and set A ⊆ Vκ with (Vκ+n, ∈, A) ⊧ φ there exists an α < κ with (Vα+n, ∈, A ∩ Vα) ⊧ φ. Following Lévy, here one looks at formulas with m-1 alternations of quantifiers with the outermost quantifier being universal. Σ-indescribable cardinals are defined in a similar way. The idea is that κ cannot be distinguished (looking from below) from smaller cardinals by any formula of n+1-th order logic with m-1 alternations of quantifiers even with the advantage of an extra unary predicate symbol (for A). This implies that it is large because it means that there must be many smaller cardinals with similar prope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
