Citizendia
Your Ad Here

Raphael Mitchel Robinson (November 2, 1911, National City California - January 27, 1995. Events 1570 - A Tidal wave in the North Sea devastates the coast from Holland to Jutland, killing more than 1000 Year 1911 ( MCMXI) was a Common year starting on Sunday (link will display the full calendar of the Gregorian calendar (or a Common year California ( is a US state on the West Coast of the United States, along the Pacific Ocean. Events 98 - Trajan becomes Roman Emperor after the death of Nerva. Year 1995 ( MCMXCV) was a Common year starting on Sunday. Events of 1995 Berkeley California) was an American mathematician. Berkeley is a city on the east shore of San Francisco Bay in Northern California, in the United States. California ( is a US state on the West Coast of the United States, along the Pacific Ocean. The United States of America —commonly referred to as the A mathematician is a person whose primary area of study and research is the field of Mathematics.

Born in National City, California, Robinson was the youngest of four children of a lawyer and a teacher. National City is a city in San Diego County, California, United States. California ( is a US state on the West Coast of the United States, along the Pacific Ocean. He was awarded the BA (1932), MA (1933), and Ph. D. (1935), all in mathematics, and all from the University of California, Berkeley. The University of California Berkeley (also referred to as Cal, Berkeley and UC Berkeley) is a major research university located in Berkeley His Ph. D. thesis, on complex analysis, was titled Some results in the theory of Schlicht functions. Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of Mathematics investigating functions of Complex In Complex analysis, the Bieberbach conjecture or de Branges's theorem, asked by and proved by, states a Necessary condition on a Holomorphic function

In 1941 Robinson married his former student Julia Bowman. Year 1941 ( MCMXLI) was a Common year starting on Wednesday (the link will display 1941 calendar of the Gregorian calendar. Julia Hall Bowman Robinson ( December 8, 1919 – July 30, 1985) was an American Mathematician, born in St She became his Berkeley colleague and the first woman president of the American Mathematical Society. The American Mathematical Society (AMS is an association of professional Mathematicians dedicated to the interests of mathematical research and scholarship which

Robinson worked on mathematical logic, set theory, geometry, number theory, and combinatorics. Mathematical logic is a subfield of Logic and Mathematics with close connections to Computer science and Philosophical logic. Geometry ( Greek γεωμετρία; geo = earth metria = measure is a part of Mathematics concerned with questions of size shape and relative position Number theory is the branch of Pure mathematics concerned with the properties of Numbers in general and Integers in particular as well as the wider classes Combinatorics is a branch of Pure mathematics concerning the study of discrete (and usually finite) objects Robinson (1937) set out a simpler and more conventional version of John Von Neumann's 1923 axiomatic set theory. In the Foundations of mathematics, Von Neumann–Bernays–Gödel set theory ( NBG) is an Axiomatic set theory that is a Conservative extension Soon after Alfred Tarski joined Berkeley's mathematics department in 1942, Robinson began to do major work on the foundations of mathematics, building on Tarski's concept of "essential undecidability," by proving a number of mathematical theories undecidable. Alfred Tarski ( January 14, 1901, Warsaw, Russian ruled Poland – October 26, 1983, Berkeley California Foundations of mathematics is a term sometimes used for certain fields of Mathematics, such as Mathematical logic, Axiomatic set theory, Proof theory In Computability theory and Computational complexity theory, a decision problem is a question in some Formal system with a yes-or-no answer depending on Robinson (1950) proved that an essentially undecidable theory need not have an infinite number of axioms by coming up with a counterexample: Robinson arithmetic Q. In traditional Logic, an axiom or postulate is a proposition that is not proved or demonstrated but considered to be either self-evident, or subject In Mathematics, Robinson arithmetic, or Q, is a finitely axiomatized fragment of Peano arithmetic (PA first set out in Robinson (1950 Q is finitely axiomatizable because it lacks Peano arithmetic's axiom schema of induction; nevertheless Q, like Peano arithmetic, is incomplete and undecidable in the sense of Gödel. In Mathematical logic, the Peano axioms, also known as the Dedekind-Peano axioms or the Peano postulates, are a set of Axioms for the Natural In Mathematical logic, Gödel's incompleteness theorems, proved by Kurt Gödel in 1931 are two Theorems stating inherent limitations of all but the most Kurt Gödel (kʊɐ̯t ˈgøːdl̩ (April 28 1906 – January 14 1978 was an Austrian American Logician, Mathematician and Philosopher Robinson's work on undecidability culminated in his coauthoring Tarski et al (1953), which established, among other things, the undecidability of group theory, lattice theory, abstract projective geometry, and closure algebras. Group theory is a mathematical discipline the part of Abstract algebra that studies the Algebraic structures known as groups. In Mathematics, a lattice is a Partially ordered set (also called a poset) in which every pair of elements has a unique Supremum (the elements' Projective geometry is a non- metrical form of Geometry, notable for its principle of duality. In Abstract algebra, an interior algebra is a certain type of Algebraic structure that encodes the idea of the topological Interior of a set

Robinson worked in number theory, even employing very early computers to obtain results. Number theory is the branch of Pure mathematics concerned with the properties of Numbers in general and Integers in particular as well as the wider classes For example, he coded the Lucas-Lehmer primality test to determine whether 2n − 1 was prime for all prime n < 2304 on a SWAC computer. This article is about the generalized Lucas–Lehmer test for primality In 1952, he showed that these Mersenne numbers were all composite except for 17 values of n = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281. He discovered the last 5 of these Mersenne primes, the largest ones known at the time. In Mathematics, a Mersenne number is a positive integer that is one less than a Power of two: M_n=2^n-1

Robinson wrote several papers on tilings of the plane, in particular a clear and remarkable 1971 paper "Undecidability and nonperiodicity for tilings of the plane" simplifying what had been a tangled theory.

Robinson became a full professor at Berkeley in 1949 and retired in 1973. He remained intellectually active until the very end of his long life. He published at age:

References

External links

The Mathematics Genealogy Project is a web-based Database that gives an Academic genealogy based on Dissertation supervision relations
© 2009 citizendia.org; parts available under the terms of GNU Free Documentation License, from http://en.wikipedia.org
 Dapyx Software network: MP3 Explorer | Ebook Manager | Zenithic