*** Welcome to piglix ***

Robert Vaught

Robert Lawson Vaught
RobertVaught.jpg
Robert Vaught UC Berkeley Logic Group picnic 1977. Leon Henkin at right.
Born (1926-04-04)April 4, 1926
Alhambra, California
Died April 2, 2002(2002-04-02) (aged 75)
Berkeley, California
Nationality American
Fields Mathematics
Institutions University of California, Berkeley
Alma mater University of California, Berkeley
Doctoral advisor Alfred Tarski
Doctoral students James Baumgartner
Ronald Fagin
Julia Knight
Jack Silver
Jerome Malitz

Robert Lawson Vaught (April 4, 1926 – April 2, 2002) was a mathematical logician, and one of the founders of model theory.

Vaught was a musical prodigy in his youth, in his case playing the piano. He began his university studies at Pomona College, at age 16. When World War II broke out, he enlisted into the US Navy which assigned him to the University of California's V-12 program. He graduated in 1945 with an AB in physics.

In 1946, he began a Ph.D. in mathematics at Berkeley. He initially worked under the supervision of the topologist John L. Kelley, writing on C* algebras. In 1950, in response to McCarthyite pressures, Berkeley required all staff to sign a loyalty oath. Kelley declined and moved his career to Tulane University for three years. Vaught then began afresh under the supervision of Alfred Tarski, completing in 1954 a thesis on mathematical logic, titled Topics in the Theory of Arithmetical Classes and Boolean Algebras. After spending four years at the University of Washington, Vaught returned to Berkeley in 1958, where he remained until his 1991 retirement.

In 1957, Vaught married Marilyn Maca; they had two children.

Vaught's work is primarily focused on model theory. In 1957, he and Tarski introduced elementary submodels and the Tarski–Vaught test characterizing them. In 1962, he and M. D. Morley pioneered the concept of a saturated structure. His investigations on countable models of first order theories led him to the Vaught conjecture stating that the number of countable models of a complete first order theory (in a countable language) is always either finite, or countably infinite, or equinumerous with the real numbers. Vaught's "Never 2" theorem states that a complete first order theory cannot have exactly 2 nonisomorphic countable models.


...
Wikipedia

...