Saharon Shelah
Orcid: 0000-0003-0462-3152Affiliations:
- Hebrew University of Jerusalem, Institute of Mathematics, Israel
According to our database1,
Saharon Shelah authored at least 456 papers
between 1970 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2026
Ann. Pure Appl. Log., 2026
2025
Ann. Pure Appl. Log., 2025
Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic, 2025
2024
Math. Log. Q., May, 2024
Ann. Pure Appl. Log., January, 2024
2023
J. Math. Log., August, 2023
J. Symb. Log., March, 2023
2022
Arch. Math. Log., 2022
2021
2020
Electron. J. Comb., 2020
2019
Notre Dame J. Formal Log., 2019
Arch. Math. Log., 2019
2018
A model of $$\mathsf {ZFA}+ \mathsf {PAC}$$ ZFA + PAC with no outer model of $$\mathsf {ZFAC}$$ ZFAC with the same pure part.
Arch. Math. Log., 2018
2017
J. Symb. Log., 2017
The nonstationary ideal on $$P_\kappa (\lambda )$$ P κ ( λ ) for $$\lambda $$ λ singular.
Arch. Math. Log., 2017
Arch. Math. Log., 2017
2016
There are no very meager sets in the model in which both the Borel Conjecture and the dual Borel Conjecture are true.
Math. Log. Q., 2016
2015
Math. Log. Q., 2015
An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers.
Proceedings of the Fields of Logic and Computation II, 2015
Proceedings of the Logic Without Borders, 2015
2014
Model-Theoretic Properties of Ultrafilters Built by Independent families of Functions.
J. Symb. Log., 2014
Ann. Pure Appl. Log., 2014
2013
Int. J. Algebra Comput., 2013
Ann. Pure Appl. Log., 2013
Arch. Math. Log., 2013
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
2011
The minimal cofinality of an ultrapower of ω and the cofinality of the symmetric groupcan be larger than <sup>+</sup>.
J. Symb. Log., 2011
2010
Filtration-equivalent aleph<sub>1</sub>-separable abelian groups of cardinality aleph<sub>1</sub>.
Ann. Pure Appl. Log., 2010
Proceedings of the Fields of Logic and Computation, 2010
2009
2008
Math. Log. Q., 2008
2007
J. Symb. Log., 2007
Ann. Pure Appl. Log., 2007
2006
Ann. Pure Appl. Log., 2006
Ann. Pure Appl. Log., 2006
Arch. Math. Log., 2006
2005
Ann. Pure Appl. Log., 2005
2004
2003
Ann. Pure Appl. Log., 2003
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003
2002
Almost free groups and Ehrenfeucht-Fraïssé games for successors of singular cardinals.
Ann. Pure Appl. Log., 2002
On the existence of large subsets of [lambda]kappa which contain no unbounded non-stationary subsets.
Arch. Math. Log., 2002
2001
Forcing Many Positive Polarized Partition Relations Between A Cardinal and Its Powerset.
J. Symb. Log., 2001
J. Symb. Log., 2001
Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property.
Comb., 2001
Bull. Symb. Log., 2001
Ann. Pure Appl. Log., 2001
Ann. Pure Appl. Log., 2001
2000
On Inverse gamma-Systems and The Number of L<sub>infinite lambda</sub>-Equivalent, Non-Isomorphic Models for lambda Singular.
J. Symb. Log., 2000
J. Symb. Log., 2000
J. Symb. Log., 2000
Covering a Function on the Plane by Two Continuous Functions on an Uncountable Square - the Consistency.
Ann. Pure Appl. Log., 2000
Ann. Pure Appl. Log., 2000
Proceedings of the Computer Science Logic, 2000
1999
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part C.
J. Symb. Log., 1999
J. Symb. Log., 1999
J. Symb. Log., 1999
Proceedings of the Set Theory: The Hajnal Conference, 1999
1998
Math. Log. Q., 1998
1997
J. Symb. Log., 1997
The Consistency of ZFC + 2<sup>aleph<sub>0</sub></sup> > aleph<sub>omega</sub> + F(aleph<sub>2</sub>) = F(aleph<sub>omega</sub>).
J. Symb. Log., 1997
Arch. Math. Log., 1997
1996
Random Struct. Algorithms, 1996
If There Is an Exactly lambda-free Abelian Group There There Is an Exactly lambda-Separable One in lambda.
J. Symb. Log., 1996
J. Symb. Log., 1996
Ann. Pure Appl. Log., 1996
In the Random Graph G(n, p), p = n<sup>-a</sup>: If psi Has Probability O(n<sup>-epsilon</sup>) for Every epsilon>0 Then it Has Probability O(e<sup>-n<sup>epsilon</sup></sup>) for Some epsilon>0.
Ann. Pure Appl. Log., 1996
Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle.
Ann. Pure Appl. Log., 1996
Arch. Math. Log., 1996
Arch. Math. Log., 1996
1995
J. Symb. Log., 1995
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part B.
J. Symb. Log., 1995
J. Symb. Log., 1995
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995
Proceedings of the Logic and Random Structures, 1995
1994
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part A.
J. Symb. Log., 1994
Ann. Pure Appl. Log., 1994
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994
1993
Ann. Pure Appl. Log., 1993
A Delta<sup>2</sup><sub>2</sub> Well-Order of the Reals and Incompactness of L(Q<sup>MM</sup>).
Ann. Pure Appl. Log., 1993
Arch. Math. Log., 1993
1992
Notre Dame J. Formal Log., 1992
Ann. Pure Appl. Log., 1992
Arch. Math. Log., 1992
1991
Arch. Math. Log., 1991
1990
The Nonaxiomatizability of L(Q<sup>2</sup><sub>ℵ<sub>1</sub></sub>) by Finitely Many Schemata.
Notre Dame J. Formal Log., 1990
The Kunen-Miller Chart (Lebesgue Measure, the Baire Property, Laver Reals and Preservation Theorems for Forcing).
J. Symb. Log., 1990
Ann. Pure Appl. Log., 1990
Classification theory - and the number of non-isomorphic models, Second Edition.
Studies in logic and the foundations of mathematics 92, North-Holland, ISBN: 978-0-444-70260-9, 1990
1989
Notre Dame J. Formal Log., 1989
J. Symb. Log., 1989
Arch. Math. Log., 1989
1988
Notre Dame J. Formal Log., 1988
Ann. Pure Appl. Log., 1988
Ann. Pure Appl. Log., 1988
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
1987
Math. Oper. Res., 1987
J. Symb. Log., 1987
Ann. Pure Appl. Log., 1987
Existence of many L<sub>∞, λ</sub>-equivalent, non- isomorphic models of T of power λ.
Ann. Pure Appl. Log., 1987
Ann. Pure Appl. Log., 1987
Ann. Pure Appl. Log., 1987
Ann. Pure Appl. Log., 1987
There may be simple Paleph<sub>1</sub> and Paleph<sub>2</sub>-points and the Rudin-Keisler ordering may be downward directed.
Ann. Pure Appl. Log., 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
Notre Dame J. Formal Log., 1986
On the Number of Nonisomorphic Models of an Infinitary Theory Which has the Infinitary Order Property, Part A.
J. Symb. Log., 1986
1985
On the possible number no(M)= the number of nonisomorphic models L<sub>INFINITY, λ</sub>-equivalent to M of power λ, for λ singular.
Notre Dame J. Formal Log., 1985
Notre Dame J. Formal Log., 1985
On the consistency of some partition theorems for continuous colorings, and the structure of aleph<sub>1</sub>-dense real order types.
Ann. Pure Appl. Log., 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
A pair of nonisomorphic ≡<sub>∞λ</sub> models of power λ for λ singular with λ<sub>ω</sub>=λ.
Notre Dame J. Formal Log., 1984
Ann. Pure Appl. Log., 1984
1983
Ann. Pure Appl. Log., 1983
Ann. Pure Appl. Log., 1983
Proceedings of the Automata, 1983
1982
On the number of nonisomorphic models in L<sub>INFINITY , κ </sub> when κ is weakly compact.
Notre Dame J. Formal Log., 1982
1981
On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements.
Notre Dame J. Formal Log., 1981
On the number of nonisomorphic models of cardinality λ L<sub>∞λ</sub>-equivalent to a fixed model.
Notre Dame J. Formal Log., 1981
Arch. Math. Log., 1981
1980
Independence of Strong Partition Relation for Small Cardinals, and the Free-Subset Problem.
J. Symb. Log., 1980
On the Elementary Equivalence of Automorphism Groups of Boolean Algebras; Downward Skolem Lowenheim Theorems and Compactness of Related Quantifiers.
J. Symb. Log., 1980
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980
1979
1978
1976
1974
J. Comb. Theory A, 1974
1973
1972
Israel Journal of Mathematics, March, 1972
Uniqueness and Characterization of Prime Models over Sets for Totally Transcendental First-Order Theories.
J. Symb. Log., 1972
1970