Random Algebra
In set theory, the random algebra or random real algebra is the Boolean algebra of Borel sets of the unit interval modulo the ideal of measure zero sets. It is used in random forcing to add random reals to a model of set theory. The random algebra was studied by John von Neumann in 1935 (in work later published as ) who showed that it is not isomorphic to the Cantor algebra of Borel sets modulo meager set In the mathematical field of general topology, a meagre set (also called a meager set or a set of first category) is a subset of a topological space that is small or negligible in a precise sense detailed below. A set that is not meagre is calle ...s. Random forcing was introduced by . See also * Random number References * * * * Boolean algebra Forcing (mathematics) {{Settheory-stub ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Set Theory
Set theory is the branch of mathematical logic that studies 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 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 theory is commonly employed as a foundational ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Boolean Algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (''and'') denoted as ∧, disjunction (''or'') denoted as ∨, and the negation (''not'') denoted as ¬. Elementary algebra, on the other hand, uses arithmetic operators such as addition, multiplication, subtraction and division. So Boolean algebra is a formal way of describing logical operations, in the same way that elementary algebra describes numerical operations. Boolean algebra was introduced by George Boole in his first book ''The Mathematical Analysis of Logic'' (1847), and set forth more fully in his '' An Investigation of the Laws of Thought'' (1854). According to Huntington, the term "Boolean algebra" wa ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Borel Set
In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel. For a topological space ''X'', the collection of all Borel sets on ''X'' forms a σ-algebra, known as the Borel algebra or Borel σ-algebra. The Borel algebra on ''X'' is the smallest σ-algebra containing all open sets (or, equivalently, all closed sets). Borel sets are important in measure theory, since any measure defined on the open sets of a space, or on the closed sets of a space, must also be defined on all Borel sets of that space. Any measure defined on the Borel sets is called a Borel measure. Borel sets and the associated Borel hierarchy also play a fundamental role in descriptive set theory. In some contexts, Borel sets are defined to be generated by the compact sets of the topological spac ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ideal (set Theory)
In the mathematical field of set theory, an ideal is a partially ordered collection of sets that are considered to be "small" or "negligible". Every subset of an element of the ideal must also be in the ideal (this codifies the idea that an ideal is a notion of smallness), and the union of any two elements of the ideal must also be in the ideal. More formally, given a set X, an ideal I on X is a nonempty subset of the powerset of X, such that: # \varnothing \in I, # if A \in I and B \subseteq A, then B \in I, and # if A, B \in I then A \cup B \in I. Some authors add a fourth condition that X itself is not in I; ideals with this extra property are called . Ideals in the set-theoretic sense are exactly ideals in the order-theoretic sense, where the relevant order is set inclusion. Also, they are exactly ideals in the ring-theoretic sense on the Boolean ring formed by the powerset of the underlying set. The dual notion of an ideal is a filter. Terminology An element of an ide ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Model (model Theory)
In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on it. Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields and vector spaces. The term universal algebra is used for structures with no relation symbols. Model theory has a different scope that encompasses more arbitrary theories, including foundational structures such as models of set theory. From the model-theoretic point of view, structures are the objects used to define the semantics of first-order logic. For a given theory in model theory, a structure is called a model if it satisfies the defining axioms of that theory, although it is sometimes disambiguated as a ''semantic model'' when one discusses the notion in the more general setting of mathematical models. Logicians sometimes refer to structures as " interpretations", whereas the term "interpretation" general ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
John Von Neumann
John von Neumann (; hu, Neumann János Lajos, ; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician, physicist, computer scientist, engineer and polymath. He was regarded as having perhaps the widest coverage of any mathematician of his time and was said to have been "the last representative of the great mathematicians who were equally at home in both pure and applied mathematics". He integrated pure and applied sciences. Von Neumann made major contributions to many fields, including mathematics (foundations of mathematics, measure theory, functional analysis, ergodic theory, group theory, lattice theory, representation theory, operator algebras, matrix theory, geometry, and numerical analysis), physics (quantum mechanics, hydrodynamics, ballistics, nuclear physics and quantum statistical mechanics), economics ( game theory and general equilibrium theory), computing ( Von Neumann architecture, linear programming, numerical meteo ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Cantor Algebra
In mathematics, a Cantor algebra, named after Georg Cantor, is one of two closely related Boolean algebras, one countable and one complete. The countable Cantor algebra is the Boolean algebra of all clopen subsets of the Cantor set. This is the free Boolean algebra on a countable number of generators. Up to isomorphism, this is the only nontrivial Boolean algebra that is both countable and atomless. The complete Cantor algebra is the complete Boolean algebra of Borel subsets of the reals modulo meager sets . It is isomorphic to the completion of the countable Cantor algebra. (The complete Cantor algebra is sometimes called the Cohen algebra, though "Cohen algebra" usually refers to a different type of Boolean algebra.) The complete Cantor algebra was studied by von Neumann in 1935 (later published as ), who showed that it is not isomorphic to the random algebra of Borel subsets modulo measure zero sets. References * *{{Citation , last1=von Neumann , first1=John , author1-link= ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Meager Set
In the mathematical field of general topology, a meagre set (also called a meager set or a set of first category) is a subset of a topological space that is small or negligible in a precise sense detailed below. A set that is not meagre is called nonmeagre, or of the second category. See below for definitions of other related terms. The meagre subsets of a fixed space form a σ-ideal of subsets; that is, any subset of a meagre set is meagre, and the union of countably many meagre sets is meagre. Meagre sets play an important role in the formulation of the notion of Baire space and of the Baire category theorem, which is used in the proof of several fundamental results of functional analysis. Definitions Throughout, X will be a topological space. A subset of X is called X, a of X, or of the in X if it is a countable union of nowhere dense subsets of X (where a nowhere dense set is a set whose closure has empty interior). The qualifier "in X" can be omitted if the ambient ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Random Number
In mathematics and statistics, a random number is either Pseudo-random or a number generated for, or part of, a set exhibiting statistical randomness. Algorithms and implementations A 1964-developed algorithm is popularly known as ''the Knuth shuffle'' or ''the Fisher–Yates shuffle'' (based on work they did in 1938). A real-world use for this is sampling water quality in a reservoir. In 1999, a new feature was added to the Pentium III: a hardware-based random number generator. It has been described as "several oscillators combine their outputs and that odd waveform is sampled asynchronously." These numbers, however, were only 32 bit, at a time when export controls were on 56 bits and higher, so they were not state of the art. Common understanding In common understanding, "1 2 3 4 5" is not as random as "3 5 2 1 4" and certainly not as random as "47 88 1 32 41" but "we can't say authoritavely that the first sequence is not random ... it could have been generated by chanc ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Annals Of Mathematics
The ''Annals of Mathematics'' is a mathematical journal published every two months by Princeton University and the Institute for Advanced Study. History The journal was established as ''The Analyst'' in 1874 and with Joel E. Hendricks as the founding editor-in-chief. It was "intended to afford a medium for the presentation and analysis of any and all questions of interest or importance in pure and applied Mathematics, embracing especially all new and interesting discoveries in theoretical and practical astronomy, mechanical philosophy, and engineering". It was published in Des Moines, Iowa, and was the earliest American mathematics journal to be published continuously for more than a year or two. This incarnation of the journal ceased publication after its tenth year, in 1883, giving as an explanation Hendricks' declining health, but Hendricks made arrangements to have it taken over by new management, and it was continued from March 1884 as the ''Annals of Mathematics''. The n ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Princeton University Press
Princeton University Press is an independent publisher with close connections to Princeton University. Its mission is to disseminate scholarship within academia and society at large. The press was founded by Whitney Darrow, with the financial support of Charles Scribner, as a printing press to serve the Princeton community in 1905. Its distinctive building was constructed in 1911 on William Street in Princeton. Its first book was a new 1912 edition of John Witherspoon's ''Lectures on Moral Philosophy.'' History Princeton University Press was founded in 1905 by a recent Princeton graduate, Whitney Darrow, with financial support from another Princetonian, Charles Scribner II. Darrow and Scribner purchased the equipment and assumed the operations of two already existing local publishers, that of the ''Princeton Alumni Weekly'' and the Princeton Press. The new press printed both local newspapers, university documents, ''The Daily Princetonian'', and later added book publishing to it ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |