2023 - Research.com Mathematics in Israel Leader Award
2022 - Research.com Mathematics in Israel Leader Award
2013 - Steele Prize for Seminal Contribution to Research
2012 - Member of Academia Europaea
2001 - Wolf Prize in Mathematics for his many fundamental contributions to mathematical logic and set theory, and their applications within other parts of mathematics.
1992 - George Pólya Prize
1991 - Fellow of the American Academy of Arts and Sciences
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Pure mathematics, Algebra over a field and Algebra. By researching both Discrete mathematics and Whitehead problem, Saharon Shelah produces research that crosses academic boundaries. His biological study spans a wide range of topics, including Consistency and Cardinality.
Simple is closely connected to Class in his research, which is encompassed under the umbrella topic of Pure mathematics. He usually deals with Algebra and limits it to topics linked to Set theory and Calculus. Saharon Shelah has researched Forcing in several fields, including Iterated function and Mathematical analysis.
His primary areas of investigation include Combinatorics, Discrete mathematics, Pure mathematics, Forcing and Algebra over a field. Specifically, his work in Combinatorics is concerned with the study of Abelian group. His work on Group expands to the thematically related Abelian group.
As part of his studies on Discrete mathematics, Saharon Shelah frequently links adjacent subjects like Class. Pure mathematics and Property are frequently intertwined in his study. His Lambda study frequently draws connections to other fields, such as Kappa.
Saharon Shelah spends much of his time researching Combinatorics, Discrete mathematics, Pure mathematics, Forcing and Omega. His Combinatorics research is multidisciplinary, incorporating perspectives in Lambda, Aleph, Class, Algebra over a field and Cardinality. His Discrete mathematics research integrates issues from Set theory and Model theory.
He combines subjects such as Chain, Independence relation and Type with his study of Pure mathematics. The concepts of his Forcing study are interwoven with issues in Null, Ideal and Extension. His Omega study which covers Uncountable set that intersects with Ideal.
Combinatorics, Pure mathematics, Discrete mathematics, Model theory and Order are his primary areas of study. His work on Uncountable set as part of his general Combinatorics study is frequently connected to Consistency, thereby bridging the divide between different branches of science. His Pure mathematics research is multidisciplinary, relying on both Partition and Forcing.
He works mostly in the field of Discrete mathematics, limiting it down to topics relating to Saturated model and, in certain cases, Measure. His Model theory study combines topics in areas such as Divide and conquer algorithms, Universality and Spectrum. His Order study combines topics from a wide range of disciplines, such as Simple and Conjecture.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Classification theory and the number of non-isomorphic models
On the temporal analysis of fairness
Dov Gabbay;Amir Pnueli;Saharon Shelah;Jonathan Stavi.
symposium on principles of programming languages (1980)
Proper and Improper Forcing
A combinatorial problem; stability and order for models and theories in infinitary languages.
Pacific Journal of Mathematics (1972)
Martin's Maximum, saturated ideals and non-regular ultrafilters. Part II
Matthew Dean Foreman;Menachem Magidor;Saharon Shelah.
Annals of Mathematics (1988)
Fixed-point extensions of first-order logic
Yuri Gurevich;Saharon Shelah;Saharon Shelah.
Annals of Pure and Applied Logic (1986)
The monadic theory of order
Annals of Mathematics (1975)
Can you take Solovay’s inaccessible away?
Saharon Shelah;Saharon Shelah.
Israel Journal of Mathematics (1984)
Infinite abelian groups, whitehead problem and some constructions
Israel Journal of Mathematics (1974)
Zero-one laws for sparse random graphs
Saharon Shelah;Joel Spencer.
Journal of the American Mathematical Society (1988)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: