Saharon Shelah  

Born  Jerusalem, British Mandate for Palestine (now Israel)  July 3, 1945
Alma mater 

Known for  Proper Forcing, PCF theory, Sauer–Shelah lemma, Shelah cardinal 
Awards 

Scientific career  
Fields  Mathematical logic, model theory, set theory 
Institutions  Hebrew University, Rutgers University 
Doctoral advisor  Michael O. Rabin 
Doctoral students  Rami Grossberg^{[1]} 
Saharon Shelah (שַׂהֲרֹן שֶׁלַח Śahăron Šelaḥ, Hebrew pronunciation: [sähäʁo̞n ʃe̞läχ]; born July 3, 1945) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey.
Shelah was born in Jerusalem on July 3, 1945. He is the son of the Israeli poet and political activist Yonatan Ratosh.^{[2]} He received his PhD for his work on stable theories in 1969 from the Hebrew University.^{[1]}
Shelah is married to Yael,^{[2]} and has three children.^{[3]} His brother, magistrate judge Hamman Shelah was murdered along with his wife and daughter by an Egyptian soldier in the Ras Burqa massacre in 1985.
Shelah planned to be a scientist while at primary school, but initially was attracted to physics and biology, not mathematics.^{[4]} Later he found mathematical beauty in studying geometry: He said, "But when I reached the ninth grade I began studying geometry and my eyes opened to that beauty—a system of demonstration and theorems based on a very small number of axioms which impressed me and captivated me." At the age of 15, he decided to become a mathematician, a choice cemented after reading Abraham Halevy Fraenkel's book An Introduction to Mathematics.^{[4]}
He received a B.Sc. from Tel Aviv University in 1964, served in the Israel Defense Forces Army between 1964 and 1967, and obtained a M.Sc. from the Hebrew University (under the direction of Haim Gaifman) in 1967.^{[5]} He then worked as a teaching assistant at the Institute of Mathematics of the Hebrew University of Jerusalem while completing a Ph.D. there under the supervision of Michael Oser Rabin,^{[5]} on a study of stable theories.
Shelah was a lecturer at Princeton University during 1969–70, and then worked as an assistant professor at the University of California, Los Angeles during 1970–71.^{[5]} He became a professor at Hebrew University in 1974, a position he continues to hold.^{[5]}
He has been a visiting professor at the following universities:^{[5]} the University of Wisconsin (1977–78), the University of California, Berkeley (1978 and 1982), the University of Michigan (1984–85), at Simon Fraser University, Burnaby, British Columbia (1985), and Rutgers University, New Jersey (1985). He has been a distinguished visiting professor at Rutgers University since 1986.^{[5]}
Shelah's personal webpage, as of February 2023^{[update]} lists 1123 published and accepted mathematical papers, as well as more than 100 preprints and papers in preparation, including joint papers with 288 coauthors;^{[6]} the American Mathematical Society's database MathSciNet lists 1147 published books and journal articles with 266 coauthors. His main interests lie in mathematical logic, model theory in particular, and in axiomatic set theory.^{[7]}
In model theory, he developed classification theory, which led him to a solution of Morley's problem. In set theory, he discovered the notion of proper forcing, an important tool in iterated forcing arguments. With PCF theory, he showed that in spite of the undecidability of the most basic questions of cardinal arithmetic (such as the continuum hypothesis), there are still highly nontrivial ZFC theorems about cardinal exponentiation. Shelah constructed a Jónsson group, an uncountable group for which every proper subgroup is countable. He showed that Whitehead's problem is independent of ZFC. He gave the first primitive recursive upper bound to van der Waerden's numbers V(C,N).^{[8]} He extended Arrow's impossibility theorem on voting systems.^{[9]}
Shelah's work has had a deep impact on model theory and set theory. The tools he developed for his classification theory have been applied to a wide number of topics and problems in model theory and have led to great advances in stability theory and its uses in algebra and algebraic geometry as shown for example by Ehud Hrushovski and many others. Classification theory involves deep work developed in many dozens of papers to completely solve the spectrum problem on classification of first order theories in terms of structure and number of nonisomorphic models, a huge tour de force. Following that he has extended the work far beyond first order theories, for example for abstract elementary classes. This work also has had important applications to algebra by works of Boris Zilber.^{[10]}