|
Controversy Over Cantor's Theory
In mathematical logic, the theory of infinite sets was first developed by Georg Cantor. Although this work has become a thoroughly standard fixture of classical set theory, it has been criticized in several areas by mathematicians and philosophers. Cantor's theorem implies that there are sets having cardinality greater than the infinite cardinality of the set of natural numbers. Cantor's argument for this theorem is presented with one small change. This argument can be improved by using a definition he gave later. The resulting argument uses only five axioms of set theory. Cantor's set theory was controversial at the start, but later became largely accepted. Most modern mathematics textbooks implicitly use Cantor's views on mathematical infinity. For example, a line is generally presented as the infinite set of its points, and it is commonly taught that there are more real numbers than rational numbers (see cardinality of the continuum). Cantor's argument Cantor's first pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability 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. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and Mathematical analysis, analysis. In the early 20th century it was shaped by David Hilbert's Hilbert's program, program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leopold Kronecker
Leopold Kronecker (; 7 December 1823 – 29 December 1891) was a German mathematician who worked on number theory, abstract algebra and logic, and criticized Georg Cantor's work on set theory. Heinrich Weber quoted Kronecker as having said, "'" ("God made the integers, all else is the work of man").The English translation is from Gray. In a footnote, Gray attributes the German quote to "Weber 1891/92, 19, quoting from a lecture of Kronecker's of 1886". Weber, Heinrich L. 1891–1892Kronecker 2:5-23. (The quote is on p. 19.) Kronecker was a student and life-long friend of Ernst Kummer. Biography Leopold Kronecker was born ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Image
An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be displayed through other media, including a Projector, projection on a surface, activation of electronic signals, or Display device, digital displays; they can also be reproduced through mechanical means, such as photography, printmaking, or Photocopier, photocopying. Images can also be Animation, animated through digital or physical processes. In the context of signal processing, an image is a distributed amplitude of color(s). In optics, the term ''image'' (or ''optical image'') refers specifically to the reproduction of an object formed by light waves coming from the object. A ''volatile image'' exists or is perceived only for a short period. This may be a reflection of an object by a mirror, a projection of a camera obscura, or a scene d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Onto
In mathematics, a surjective function (also known as surjection, or onto function ) is a function such that, for every element of the function's codomain, there exists one element in the function's domain such that . In other words, for a function , the codomain is the image of the function's domain . It is not required that be unique; the function may map one or more elements of to the same element of . The term ''surjective'' and the related terms '' injective'' and ''bijective'' were introduced by Nicolas Bourbaki, a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word '' sur'' means ''over'' or ''above'', and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain. Any function induces a surjection by restricting its codomain to the image of its domain. Every surjec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Penn Mayberry
John Penn Mayberry (18 November 1939 – 19 August 2016) was an American mathematical philosopher and creator of a distinctive Aristotelian philosophy of mathematics to which he gave expression in his book ''The Foundations of Mathematics in the Theory of Sets''. Following completion of a Ph.D. at Illinois under the supervision of Gaisi Takeuti, he took up, in 1966, a position in the mathematics department of the University of Bristol The University of Bristol is a public university, public research university in Bristol, England. It received its royal charter in 1909, although it can trace its roots to a Merchant Venturers' school founded in 1595 and University College, Br .... He remained there until his retirement in 2004 as a Reader in Mathematics. Philosophical work Mayberry's philosophy rejects the Philosophy of mathematics#Platonism, Platonic tradition, which holds mathematics to be a transcendental science concerned with discovering truths about immaterial, but in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equinumerous
In mathematics, two sets or classes ''A'' and ''B'' are equinumerous if there exists a one-to-one correspondence (or bijection) between them, that is, if there exists a function from ''A'' to ''B'' such that for every element ''y'' of ''B'', there is exactly one element ''x'' of ''A'' with ''f''(''x'') = ''y''. Equinumerous sets are said to have the same cardinality (number of elements). The study of cardinality is often called equinumerosity (''equalness-of-number''). The terms equipollence (''equalness-of-strength'') and equipotence (''equalness-of-power'') are sometimes used instead. Equinumerosity has the characteristic properties of an equivalence relation. The statement that two sets ''A'' and ''B'' are equinumerous is usually denoted :A \approx B \, or A \sim B, or , A, =, B, . The definition of equinumerosity using bijections can be applied to both finite and infinite sets, and allows one to state whether two sets have the same size even if they are infinite. Geo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gottlob Frege
Friedrich Ludwig Gottlob Frege (; ; 8 November 1848 – 26 July 1925) was a German philosopher, logician, and mathematician. He was a mathematics professor at the University of Jena, and is understood by many to be the father of analytic philosophy, concentrating on the philosophy of language, philosophy of logic, logic, and Philosophy of mathematics, mathematics. Though he was largely ignored during his lifetime, Giuseppe Peano (1858–1932), Bertrand Russell (1872–1970), and, to some extent, Ludwig Wittgenstein (1889–1951) introduced his work to later generations of philosophers. Frege is widely considered to be the greatest logician since Aristotle, and one of the most profound philosophers of mathematics ever. His contributions include the History of logic#Rise of modern logic, development of modern logic in the ''Begriffsschrift'' and work in the foundations of mathematics. His book the ''Foundations of Arithmetic'' is the seminal text of the logicist project, and is ci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hume's Principle
Hume's principle or HP says that, given two collections of objects \mathcal F and \mathcal G with properties F and G respectively, the number of objects with property F is equal to the number of objects with property G if and only if there is a one-to-one correspondence (a bijection) between \mathcal F and \mathcal G. In other words, that bijections are the "correct" way of measuring size. HP can be stated formally in systems of second-order logic. It is named for the Scottish philosopher David Hume and was coined by George Boolos. The principle plays a central role in Gottlob Frege's philosophy of mathematics. Frege shows that HP and suitable definitions of arithmetical notions entail all axioms of what we now call second-order arithmetic. This result is known as Frege's theorem, which is the foundation for a philosophy of mathematics known as neo-logicism. Origins Hume's Principle appears in Frege's ''Foundations of Arithmetic'' (§63), which quotes from Part III of Boo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-to-one Correspondence
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mapped f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Power Set
In mathematics, the axiom of power set is one of the Zermelo–Fraenkel axioms of axiomatic set theory. It guarantees for every set x the existence of a set \mathcal(x), the power set of x, consisting precisely of the subsets of x. By the axiom of extensionality, the set \mathcal(x) is unique. The axiom of power set appears in most axiomatizations of set theory. It is generally considered uncontroversial, although constructive set theory prefers a weaker version to resolve concerns about predicativity. Formal statement The subset relation \subseteq is not a primitive notion in formal set theory and is not used in the formal language of the Zermelo–Fraenkel axioms. Rather, the subset relation \subseteq is defined in terms of set membership, \in. Given this, in the formal language of the Zermelo–Fraenkel axioms, the axiom of power set reads: :\forall x \, \exists y \, \forall z \, \in y \iff \forall w \, (w \in z \Rightarrow w \in x)/math> where ''y'' is the power s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Infinity
In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908. Formal statement Using first-order logic primitive symbols, the axiom can be expressed as follows: \exist \mathrm \ (\exist o \ (o \in \mathrm \ \land \lnot \exist n \ (n \in o)) \ \land \ \forall x \ (x \in \mathrm \Rightarrow \exist y \ (y \in \mathrm \ \land \ \forall a \ (a \in y \Leftrightarrow (a \in x \ \lor \ a = x))))). If the notations of both set-builder and empty set are allowed: \exists \mathrm \, ( \varnothing \in \mathrm \, \land \, \forall x \, (x \in \mathrm \Rightarrow \, ( x \cup \ ) \in \mathrm ) ). Some mathematicians may call a set built this way an inductive set. Hint: In English, it reads: " There exists a set ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiomatic Set Theory
Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathematics – is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory. The non-formalized systems investigated during this early stage go under the name of ''naive set theory''. After the discovery of Paradoxes of set theory, paradoxes within naive set theory (such as Russell's paradox, Cantor's paradox and the Burali-Forti paradox), various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied. Set the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
