The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Saharon Shelah: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuri Gurevich, Saharon Shelah
    Fixed-Point Extensions of First-Order Logic [Citation Graph (11, 0)][DBLP]
    FOCS, 1985, pp:346-353 [Conf]
  2. Dov M. Gabbay, Amir Pnueli, Saharon Shelah, Jonathan Stavi
    On the Temporal Basis of Fairness. [Citation Graph (5, 0)][DBLP]
    POPL, 1980, pp:163-173 [Conf]
  3. Larry Denenberg, Yuri Gurevich, Saharon Shelah
    Definability by Constant-Depth Polynomial-Size Circuits [Citation Graph (1, 0)][DBLP]
    Information and Control, 1986, v:70, n:2/3, pp:216-240 [Journal]
  4. Daniel J. Lehmann, Saharon Shelah
    Reasoning with Time and Chance [Citation Graph (1, 0)][DBLP]
    Information and Control, 1982, v:53, n:3, pp:165-198 [Journal]
  5. Saharon Shelah
    Choiceless Polynominal Time Logic: Inability to Express. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:72-125 [Conf]
  6. Yuri Gurevich, Saharon Shelah
    Nearly Linear Time. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:108-118 [Conf]
  7. Daniel J. Lehmann, Saharon Shelah
    Reasoning with Time and Chance (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:445-457 [Conf]
  8. Yuri Gurevich, Neil Immerman, Saharon Shelah
    McColm's Conjecture [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:10-19 [Conf]
  9. Yuri Gurevich, Saharon Shelah
    Spectra of Monadic Second-Order Formulas with One Unary Function. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:291-300 [Conf]
  10. Yuri Gurevich, Saharon Shelah
    Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:281-289 [Conf]
  11. Saharon Shelah, Joel Spencer
    Threshold Spectra for Random Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:421-424 [Conf]
  12. Tomek Bartoszynski, Saharon Shelah
    Strongly meager sets of size continuum. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:8, pp:769-779 [Journal]
  13. Saharon Shelah
    More Jonsson Algebras. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:1, pp:1-44 [Journal]
  14. Saharon Shelah
    On nice equivalence relations on ?2. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:1, pp:31-64 [Journal]
  15. Saharon Shelah
    Forcing axiom failure for any lambda > aleph1. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:3, pp:285-296 [Journal]
  16. Jörg Brendle, Saharon Shelah
    Evasion and prediction. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:4, pp:349-360 [Journal]
  17. Mirna Dzamonja, Saharon Shelah
    On the existence of universal models. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:7, pp:901-936 [Journal]
  18. Saharon Shelah, Jouko A. Väänänen
    A note on extensions of infinitary logic. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:1, pp:63-69 [Journal]
  19. Heike Mildenberger, Saharon Shelah
    Specialising Aronszajn trees by countable approximations. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:7, pp:627-647 [Journal]
  20. Andrzej Roslanowski, Saharon Shelah
    Sweet & sour and other flavours of ccc forcing notions. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:5, pp:583-664 [Journal]
  21. Saharon Shelah
    Middle diamond. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:5, pp:527-560 [Journal]
  22. Todd Eisworth, Saharon Shelah
    Successors of singular cardinals and coloring theorems I. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2005, v:44, n:5, pp:597-618 [Journal]
  23. Frank Niedermeyer, Saharon Shelah, Karsten Steffens
    The f-factor Problem for Graphs and the Hereditary Property. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:6, pp:665-672 [Journal]
  24. Uri Abraham, Saharon Shelah
    A Delta22 Well-Order of the Reals and Incompactness of L(QMM). [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:59, n:1, pp:1-32 [Journal]
  25. John T. Baldwin, Saharon Shelah
    The Primal Framework I. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:46, n:3, pp:235-264 [Journal]
  26. John T. Baldwin, Saharon Shelah
    The Primal Framework II: Smoothness. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:55, n:1, pp:1-34 [Journal]
  27. Tomek Bartoszynski, Saharon Shelah
    Closed Measure Zero Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:58, n:2, pp:93-110 [Journal]
  28. Andreas Blass, Yuri Gurevich, Saharon Shelah
    Choiceless Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:100, n:1-3, pp:141-187 [Journal]
  29. Jörg Brendle, Haim Judah, Saharon Shelah
    Combinatorial Properties of Hechler Forcing. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:58, n:3, pp:185-199 [Journal]
  30. James Cummings, Saharon Shelah
    Cardinal Invariants Above the Continuum. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:3, pp:251-268 [Journal]
  31. Mirna Dzamonja, Saharon Shelah
    On lhd*-maximality. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:125, n:1-3, pp:119-158 [Journal]
  32. Mirna Dzamonja, Saharon Shelah
    Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:79, n:3, pp:289-316 [Journal]
  33. Sakaé Fuchino, Stefan Geschke, Saharon Shelah, Lajos Soukup
    On the weak Freese-Nation property of complete Boolean algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:110, n:1-3, pp:89-105 [Journal]
  34. Sakaé Fuchino, Sabine Koppelberg, Saharon Shelah
    Partial Orderings with the Weak Freese-Nation Property. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:1, pp:35-54 [Journal]
  35. Sakaé Fuchino, Saharon Shelah, Lajos Soukup
    Sticks and Clubs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:90, n:1-3, pp:57-77 [Journal]
  36. Moti Gitik, Saharon Shelah
    More on Simple Forcing Notions and Forcings with Ideals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:59, n:3, pp:219-238 [Journal]
  37. Steven Givant, Saharon Shelah
    Universal Theories Categorical in Power and kappa-Generated Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:69, n:1, pp:27-51 [Journal]
  38. Martin Goldstern, Saharon Shelah
    Ramsey Ultrafilters and the Reaping Number - Con(r<u). [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:49, n:2, pp:121-142 [Journal]
  39. Ehud Hrushovski, Saharon Shelah
    A Dichotomy Theorem for Regular Types. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:45, n:2, pp:157-169 [Journal]
  40. Tapani Hyttinen, Saharon Shelah
    Strong Splitting in Stable Homogeneous Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:103, n:1-3, pp:201-228 [Journal]
  41. Jaime I. Ihoda, Saharon Shelah
    Delta12-Sets of Reals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:42, n:3, pp:207-223 [Journal]
  42. Renling Jin, Saharon Shelah
    Essential Kurepa Trees versus Essential Jech-Kunen Trees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:69, n:1, pp:107-131 [Journal]
  43. Renling Jin, Saharon Shelah
    Can a Small Forcing Create Kurepa Trees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:85, n:1, pp:47-68 [Journal]
  44. Haim Judah, Saharon Shelah, W. Hugh Woodin
    The Borel Conjecture. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:50, n:3, pp:255-269 [Journal]
  45. Menachem Kojman, Saharon Shelah
    Fallen cardinals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:109, n:1-2, pp:117-129 [Journal]
  46. Menachem Kojman, Saharon Shelah
    The Universality Spectrum of Stable Unsuperstable Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:58, n:1, pp:57-72 [Journal]
  47. Wieslaw Kubis, Saharon Shelah
    Analytic colorings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:121, n:2-3, pp:145-161 [Journal]
  48. Salma Kuhlmann, Saharon Shelah
    k-bounded exponential-logarithmic power series fields. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:284-296 [Journal]
  49. Michael C. Laskowski, Saharon Shelah
    Karp complexity and classes with the independence property. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:120, n:1-3, pp:263-283 [Journal]
  50. Alain Louveau, Saharon Shelah, Boban Velickovic
    Borel Partitions of Infinite Subtrees of a Perfect Tree. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:63, n:3, pp:271-281 [Journal]
  51. Heike Mildenberger, Saharon Shelah
    Changing cardinal characteristics without changing Omega-sequences or cofinalities. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:106, n:1-3, pp:207-260 [Journal]
  52. Mariusz Rabus, Saharon Shelah
    Covering a Function on the Plane by Two Continuous Functions on an Uncountable Square - the Consistency. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:103, n:1-3, pp:229-240 [Journal]
  53. Andrzej Roslanowski, Saharon Shelah
    More on Cardinal Invariants of Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:103, n:1-3, pp:1-37 [Journal]
  54. Saharon Shelah
    Cardinalities of Topologies with Small Base. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:68, n:1, pp:95-113 [Journal]
  55. Saharon Shelah
    Toward Classifying Unstable Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:3, pp:229-255 [Journal]
  56. Saharon Shelah
    In the Random Graph G(n, p), p = n-a: If psi Has Probability O(n-epsilon) for Every epsilon>0 Then it Has Probability O(e-nepsilon) for Some epsilon>0. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:82, n:1, pp:97-102 [Journal]
  57. Saharon Shelah
    Was Sierpinski Right? III: Can Continuum-cc. Times c.c.c. be Continuum-c.c.? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:259-269 [Journal]
  58. Saharon Shelah
    Colouring and Non-Productivity of aleph2-C.C. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:84, n:2, pp:153-174 [Journal]
  59. Saharon Shelah
    Categoricity for Abstract Classes with Amalgamation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:261-294 [Journal]
  60. Saharon Shelah, Steven Buechler
    On the Existence of Regular Types. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:45, n:3, pp:277-308 [Journal]
  61. Saharon Shelah, Claude Laflamme, Bradd Hart
    Models with Second Order Properties V: A General Principle. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:64, n:2, pp:169-194 [Journal]
  62. Saharon Shelah, Michael Makkai
    Categoricity of Theories in Lk omega, with k a Compact Ordinal. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:47, n:1, pp:41-97 [Journal]
  63. Saharon Shelah, J. K. Truss
    On Distinguishing Quotients of Symmetric Groups. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:47-83 [Journal]
  64. Saharon Shelah, Pauli Väisänen
    Almost free groups and Ehrenfeucht-Fraïssé games for successors of singular cardinals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:118, n:1-2, pp:147-173 [Journal]
  65. Saharon Shelah, Andrés Villaveces
    Toward Categoricity for Classes with no Maximal Models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:1-25 [Journal]
  66. Saharon Shelah, Jindrich Zapletal
    Canonical Models for N1-Combinatorics. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:217-259 [Journal]
  67. Sakaé Fuchino, Noam Greenberg, Saharon Shelah
    Models of real-valued measurability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:380-397 [Journal]
  68. Mirna Dzamonja, Saharon Shelah
    On properties of theories which preclude the existence of universal models. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:280-302 [Journal]
  69. Heike Mildenberger, Saharon Shelah, Boaz Tsaban
    Covering the Baire space by families which are not finitely dominating. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:140, n:1-3, pp:60-71 [Journal]
  70. Saharon Shelah
    More on the revised GCH and the black box. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:140, n:1-3, pp:133-160 [Journal]
  71. Lorenz Halbeisen, Saharon Shelah
    Relations between some cardinals in the absence of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2001, v:7, n:2, pp:237-261 [Journal]
  72. Saharon Shelah
    Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:309-319 [Journal]
  73. Péter Komjáth, Saharon Shelah
    A Partition Theorem for Scattered Order Types. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:621-626 [Journal]
  74. Jaroslav Nesetril, Saharon Shelah
    On the order of countable graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:6, pp:649-663 [Journal]
  75. Yuri Gurevich, Saharon Shelah
    Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:674-687 [Journal]
  76. Fred Galvin, Saharon Shelah
    Some Counterexamples in the Partition Calculus. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:15, n:2, pp:167-174 [Journal]
  77. Menachem Kojman, Saharon Shelah
    Regressive Ramsey Numbers Are Ackermannian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:177-181 [Journal]
  78. Péter Komjáth, Saharon Shelah
    Universal Graphs without Large Cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:125-135 [Journal]
  79. Saharon Shelah
    A Substitute for Hall's Theorem for Families with Infinite Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:2, pp:199-208 [Journal]
  80. Saharon Shelah
    Decomposing Uncountable Squares to Countably Many Chains. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:1, pp:110-114 [Journal]
  81. Saharon Shelah
    Erdos and Rényi Conjecture . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:82, n:2, pp:179-185 [Journal]
  82. Saharon Shelah, Alexander Soifer
    Axiom of choice and chromatic number of the plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:103, n:2, pp:387-391 [Journal]
  83. Alexander Soifer, Saharon Shelah
    Axiom of choice and chromatic number: examples on the plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:105, n:2, pp:359-364 [Journal]
  84. Gregory L. Cherlin, Saharon Shelah
    Universal graphs with a forbidden subtree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:293-333 [Journal]
  85. Uri Abraham, Saharon Shelah
    Forcing With Stable Posets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1982, v:47, n:1, pp:37-42 [Journal]
  86. Uri Abraham, Saharon Shelah
    Coding with Ladders A Well Ordering of The Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:2, pp:579-597 [Journal]
  87. Uri Abraham, Saharon Shelah
    Forcing Closed Unbounded Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:643-657 [Journal]
  88. Uri Abraham, Saharon Shelah
    On the Intersection of Closed Unbounded Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:1, pp:180-189 [Journal]
  89. Marek Balcerzak, Andrzej Roslanowski, Saharon Shelah
    Ideals without CCC. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:128-148 [Journal]
  90. John T. Baldwin, Rami P. Grossberg, Saharon Shelah
    Transfering Saturation, The Finite Cover Property, and Stability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:2, pp:678-684 [Journal]
  91. John T. Baldwin, Michael C. Laskowski, Saharon Shelah
    Forcing Isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1291-1301 [Journal]
  92. John T. Baldwin, Saharon Shelah
    Abstract Classes with Few Models Have `Homogeneous-Universal' Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:246-265 [Journal]
  93. John T. Baldwin, Saharon Shelah
    DOP and FCP in Generic Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:427-438 [Journal]
  94. Tomek Bartoszynski, Jaime I. Ihoda, Saharon Shelah
    The Cofinality of Cardinal Invariants Related to Measure and Category. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:719-726 [Journal]
  95. Tomek Bartoszynski, Haim Judah, Saharon Shelah
    The Cichon Diagram. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:401-423 [Journal]
  96. Tomek Bartoszynski, Andrzej Roslanowski, Saharon Shelah
    After All, There Are Some Inequalities Which Are Provable in ZFC. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:803-816 [Journal]
  97. Tomek Bartoszynski, Andrzej Roslanowski, Saharon Shelah
    Adding One Random Real. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:1, pp:80-90 [Journal]
  98. Balázs Biró, Saharon Shelah
    Isomorphic but not Lower Base-Isomorphic Cylindric Set Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:3, pp:846-853 [Journal]
  99. Andreas Blass, Yuri Gurevich, Saharon Shelah
    On Polynomial Time Computation over Unordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:3, pp:1093-1125 [Journal]
  100. Aleksander Blaszczyk, Saharon Shelah
    Regular Subalgebras of Complete Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:792-800 [Journal]
  101. Krzysztof Ciesielski, Saharon Shelah
    A Model With No Magic Set. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1467-1490 [Journal]
  102. James Cummings, Saharon Shelah
    A Model in Which Every Boolean Algebra Has Many Subalgebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:3, pp:992-1004 [Journal]
  103. Mirna Dzamonja, Saharon Shelah
    Universal graphs at the successor of a singular cardinal. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:2, pp:366-388 [Journal]
  104. Mirna Dzamonja, Saharon Shelah
    Similar But Not The Same: Various Versions of Clubs Do Not Coincide. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:180-198 [Journal]
  105. Matthew Foreman, Menachem Magidor, Saharon Shelah
    0 # and Some Forcing Principles. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:1, pp:39-46 [Journal]
  106. Rvszard Frankiewicz, Saharon Shelah, Pawel Zbierski
    On Closed P-Sets with ccc in the Space omega*. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1171-1176 [Journal]
  107. Moti Gitik, Saharon Shelah
    Cardinal Preserving Ideals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1527-1551 [Journal]
  108. Martin Gilchrist, Saharon Shelah
    Identities on Cardinals less than alephomega. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:3, pp:780-787 [Journal]
  109. Martin Gilchrist, Saharon Shelah
    The Consistency of ZFC + 2aleph0 > alephomega + F(aleph2) = F(alephomega). [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:4, pp:1151-1160 [Journal]
  110. Warren D. Goldfarb, Yuri Gurevich, Saharon Shelah
    A Decidable Subclass of the Minimal Godel Class with Identity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1253-1261 [Journal]
  111. Martin Goldstern, Haim Judah, Saharon Shelah
    Strong Measure Zero Sets Without Cohen Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1323-1341 [Journal]
  112. Martin Goldstern, Saharon Shelah
    The Bounded Proper Forcing Axiom. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:58-73 [Journal]
  113. Rami P. Grossberg, Saharon Shelah
    On the Number of Nonisomorphic Models of an Infinitary Theory Which has the Infinitary Order Property, Part A. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:302-322 [Journal]
  114. Joel David Hamkins, Saharon Shelah
    Superdestructibility: A Dual to Laver's Indestructibility. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:549-554 [Journal]
  115. Yuri Gurevich, Menachem Magidor, Saharon Shelah
    The Monadic Theory of omega12. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:2, pp:387-398 [Journal]
  116. Yuri Gurevich, Saharon Shelah
    Modest Theory of Short Chains. II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:4, pp:491-502 [Journal]
  117. Yuri Gurevich, Saharon Shelah
    Interpreting Second-Order Logic in the Monadic Theory of Order. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:816-828 [Journal]
  118. Yuri Gurevich, Saharon Shelah
    Rabin's Uniformization Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:4, pp:1105-1119 [Journal]
  119. Yuri Gurevich, Saharon Shelah
    Random Models and the Godel Case of the Decision Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:4, pp:1120-1124 [Journal]
  120. Yuri Gurevich, Saharon Shelah
    The Decision Problem for Branching Time Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:3, pp:668-681 [Journal]
  121. Yuri Gurevich, Saharon Shelah
    On the Strength of the Interpretation Method. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:305-323 [Journal]
  122. Yuri Gurevich, Saharon Shelah
    Time Polynomial in Input or Output. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:1083-1088 [Journal]
  123. Yuri Gurevich, Saharon Shelah
    On Finite Rigid Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:2, pp:549-562 [Journal]
  124. Lorenz Halbeisen, Saharon Shelah
    Consequences of Arithmetic for Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:1, pp:30-40 [Journal]
  125. Wilfried Hodges, Saharon Shelah
    There Are Reasonably Nice Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:1, pp:300-322 [Journal]
  126. Tapani Hyttinen, Saharon Shelah
    Main Gap for Locally Saturated Elementary Submodels of A Homogeneous Structure. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1286-1302 [Journal]
  127. Tapani Hyttinen, Saharon Shelah
    Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part A. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:3, pp:984-996 [Journal]
  128. Tapani Hyttinen, Saharon Shelah
    Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part B. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:4, pp:1260-1272 [Journal]
  129. Tapani Hyttinen, Saharon Shelah
    Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part C. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:2, pp:634-642 [Journal]
  130. Jaime I. Ihoda, Saharon Shelah
    Souslin Forcing. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:4, pp:1188-1207 [Journal]
  131. Jaime I. Ihoda, Saharon Shelah
    Martin's Axioms, Measurability and Equiconsistency Results. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:1, pp:78-94 [Journal]
  132. Thomas Jech, Saharon Shelah
    Full Reflection of Stationary Sets Below alephomega. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:2, pp:822-830 [Journal]
  133. Thomas Jech, Saharon Shelah
    Possible pcf Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:1, pp:313-317 [Journal]
  134. Thomas Jech, Saharon Shelah
    On Countably Closed Complete Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1380-1386 [Journal]
  135. Haim Judah, Saharon Shelah
    The Kunen-Miller Chart (Lebesgue Measure, the Baire Property, Laver Reals and Preservation Theorems for Forcing). [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:3, pp:909-927 [Journal]
  136. Haim Judah, Saharon Shelah
    Forcing Minimal Degree of Constructibility. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:3, pp:769-782 [Journal]
  137. Haim Judah, Saharon Shelah
    Delta13-Sets of Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:1, pp:72-80 [Journal]
  138. Renling Jin, Saharon Shelah
    The Strength of the Isomorphism Property. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:1, pp:292-301 [Journal]
  139. Renling Jin, Saharon Shelah
    Compactness of Loeb Spaces. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:4, pp:1371-1392 [Journal]
  140. Juliette Kennedy, Saharon Shelah
    On Regular Reduced Products. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:3, pp:1169-1177 [Journal]
  141. Hirotaka Kikyo, Saharon Shelah
    The Strict Order Property and Generic Automorphisms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:214-216 [Journal]
  142. Menachem Kojman, Saharon Shelah
    Nonexistence of Universal Orders in Many Cardinals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:3, pp:875-891 [Journal]
  143. Péter Komjáth, Saharon Shelah
    Two Consistency Results on Set Mappings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:333-338 [Journal]
  144. Péter Komjáth, Saharon Shelah
    Forcing Constructions for Uncountably Chromatic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:3, pp:696-707 [Journal]
  145. Michael C. Laskowski, Saharon Shelah
    On the Existence of Atomic Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1189-1194 [Journal]
  146. Michael C. Laskowski, Saharon Shelah
    Forcing Isomorphism II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1305-1320 [Journal]
  147. Shmuel Lifsches, Saharon Shelah
    Uniformization, Choice Functions and Well Orders in the Class of Trees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1206-1227 [Journal]
  148. Shmuel Lifsches, Saharon Shelah
    Peano Arithmetic Maybe Not Be Interpretable in the Monadic Theory of Linear Orders. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:848-872 [Journal]
  149. Shmuel Lifsches, Saharon Shelah
    Uniformization and Skolem Functions in the Class of Trees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:103-127 [Journal]
  150. Menachem Magidor, Saharon Shelah, Jonathan Stavi
    On the Standard Part of Nonstandard Models of Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:1, pp:33-38 [Journal]
  151. Alan H. Mekler, Saharon Shelah
    Uniformization Principles. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:441-459 [Journal]
  152. Heike Mildenberger, Saharon Shelah
    The Relative Consistency of g < cf (Sym(omega)). [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:297-314 [Journal]
  153. Andrzej Roslanowski, Saharon Shelah
    Simple Forcing Notions and Forcing Axioms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:4, pp:1297-1314 [Journal]
  154. Matatyahu Rubin, Saharon Shelah
    On the Elementary Equivalence of Automorphism Groups of Boolean Algebras; Downward Skolem Lowenheim Theorems and Compactness of Related Quantifiers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:2, pp:265-283 [Journal]
  155. Matatyahu Rubin, Saharon Shelah
    On the Expressibility Hierarchy of Magidor-Malitz Quantifiers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:542-557 [Journal]
  156. James H. Schmerl, Saharon Shelah
    On Power-like Models for Hyperinaccessible Cardinals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:3, pp:531-537 [Journal]
  157. G. Sageev, Saharon Shelah
    On the Structure of Ext(A, Z) in ZFC+. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:2, pp:302-315 [Journal]
  158. Ofer Shafir, Saharon Shelah
    More on Entangled Orders. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1823-1832 [Journal]
  159. Saharon Shelah
    Was Sierpinski Right? IV. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:3, pp:1031-1054 [Journal]
  160. Saharon Shelah
    On Quantification with A Finite Universe. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:3, pp:1055-1075 [Journal]
  161. Saharon Shelah
    Applications of PCF Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1624-1674 [Journal]
  162. Saharon Shelah
    On Theories T Categorical in absolut T. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1970, v:35, n:1, pp:73-82 [Journal]
  163. Saharon Shelah
    On the Cardinality of Ultraproduct of Finite Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1970, v:35, n:1, pp:83-84 [Journal]
  164. Saharon Shelah
    Uniqueness and Characterization of Prime Models over Sets for Totally Transcendental First-Order Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:1, pp:107-113 [Journal]
  165. Saharon Shelah
    On Models with Power-Like Ordering. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:2, pp:247-267 [Journal]
  166. Saharon Shelah
    Weak Definability in Infinitary Languages. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:3, pp:399-404 [Journal]
  167. Saharon Shelah
    On the Number of Minimal Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:475-480 [Journal]
  168. Saharon Shelah
    End Extensions and Numbers of Countable Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:550-562 [Journal]
  169. Saharon Shelah
    On Uniqueness of Prime Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:2, pp:215-220 [Journal]
  170. Saharon Shelah
    Hanf Number of Omitting Type for Simple First-Order Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:3, pp:319-324 [Journal]
  171. Saharon Shelah
    A Note on Cardinal Exponentiation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:1, pp:56-66 [Journal]
  172. Saharon Shelah
    Independence of Strong Partition Relation for Small Cardinals, and the Free-Subset Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:3, pp:505-509 [Journal]
  173. Saharon Shelah
    Independence Results. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:3, pp:563-573 [Journal]
  174. Saharon Shelah
    Canonization Theorems and Applications. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:2, pp:345-353 [Journal]
  175. Saharon Shelah
    Diamonds, Uniformization. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1022-1033 [Journal]
  176. Saharon Shelah
    More on Proper Forcing. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1034-1038 [Journal]
  177. Saharon Shelah
    Semiproper Forcing Axiom Implies Martin Maximum but Not PFA+. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:2, pp:360-367 [Journal]
  178. Saharon Shelah
    The Number of Pairwise Non-Elementary-Embeddable Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1431-1455 [Journal]
  179. Saharon Shelah
    Strong Negative Partition Above the Continuum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:1, pp:21-31 [Journal]
  180. Saharon Shelah
    If There Is an Exactly lambda-free Abelian Group There There Is an Exactly lambda-Separable One in lambda. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1261-1278 [Journal]
  181. Saharon Shelah, D. H. Fremlin
    Pointwise Compact and Stable Sets of Measurable Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:435-455 [Journal]
  182. Saharon Shelah, Lee J. Stanley
    Filters, Cohen Sets and Consistent Extensions of The Erdös-Dushnik-Miller Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:259-271 [Journal]
  183. Saharon Shelah, Juris Steprans
    The Covering Numbers of Mycielski Ideals Are All Equal. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:707-718 [Journal]
  184. Saharon Shelah, Lee J. Stanley
    Forcing Many Positive Polarized Partition Relations Between A Cardinal and Its Powerset. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1359-1370 [Journal]
  185. Saharon Shelah, Lee J. Stanley
    A Combinatorial Forcing for Coding the Universe by a Real When There Are No Sharps. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:1-35 [Journal]
  186. Saharon Shelah, Lee J. Stanley
    The Combinatorics of Combinatorial Coding by a Real. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:36-57 [Journal]
  187. Saharon Shelah, Simon Thomas
    Subgroups of Small Index in Infinite Symmetric Groups II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:1, pp:95-99 [Journal]
  188. Saharon Shelah, Simon Thomas
    The Cofinality Spectrum of the Infinite Symmetric Group. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:902-916 [Journal]
  189. Saharon Shelah, Heikki Tuuri, Jouko A. Väänänen
    On the Number of Automorphisms of Uncountable Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1402-1418 [Journal]
  190. Saharon Shelah, Pauli Väisänen
    On Inverse gamma-Systems and The Number of Linfinite lambda-Equivalent, Non-Isomorphic Models for lambda Singular. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:272-284 [Journal]
  191. Saharon Shelah, Jouko A. Väänänen
    Stationary Sets and Infinitary Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:3, pp:1311-1320 [Journal]
  192. Saharon Shelah, W. Hugh Woodin
    Forcing the Failure of Ch by Adding a Real. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1185-1189 [Journal]
  193. Saharon Shelah, Martin Ziegler 0002
    Algebraically Closed Groups of Large Cardinality. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:4, pp:522-532 [Journal]
  194. Saharon Shelah
    On the Very Weak 0-1 Law for Random Graphs with Orders. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:1, pp:137-159 [Journal]
  195. Tapani Hyttinen, Saharon Shelah
    On the Number of Elementary Submodels of an Unsuperstable Homogeneous Structure. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:354-358 [Journal]
  196. Gábor Sági, Saharon Shelah
    On topological properties of ultraproducts of finite sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:3, pp:254-257 [Journal]
  197. Saharon Shelah
    Two cardinals models with gap one revisited. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:5, pp:437-447 [Journal]
  198. Saharon Shelah, Jouko A. Väänänen
    Recursive logic frames. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2006, v:52, n:2, pp:151-164 [Journal]
  199. Andrzej Roslanowski, Saharon Shelah
    How much sweetness is there in the universe? [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2006, v:52, n:1, pp:71-86 [Journal]
  200. John T. Baldwin, Saharon Shelah
    Model Companions of for Stable T. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 2001, v:42, n:3, pp:129-142 [Journal]
  201. James E. Baumgartner, Saharon Shelah, Simon Thomas
    Maximal Subsets of Infinite Symmetric Groups. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1993, v:34, n:1, pp:1-11 [Journal]
  202. Andreas Blass, Saharon Shelah
    Near Coherence of Filters III: A Simplified Consistency Proof. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1989, v:30, n:4, pp:530-538 [Journal]
  203. Tapani Hyttinen, Saharon Shelah, Heikki Tuuri
    Remarks on Strong Nonstructure Theorems. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1993, v:34, n:2, pp:157-168 [Journal]
  204. Saharon Shelah
    The Hanf numbers of stationary logic II: Comparison with other logics. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1992, v:33, n:1, pp:1-12 [Journal]
  205. Saharon Shelah, Charles Steinhorn
    The Nonaxiomatizability of L(Q2aleph1) by Finitely Many Schemata. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1990, v:31, n:1, pp:1-13 [Journal]
  206. Saharon Shelah, Akito Tsuboi
    Definability of Initial Segments. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 2002, v:43, n:2, pp:65-73 [Journal]
  207. Martin Goldstern, Saharon Shelah
    Antichains in Products of Linear Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:3, pp:213-222 [Journal]
  208. Tomasz Luczak, Saharon Shelah
    Convergence in Homogeneous Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:371-393 [Journal]
  209. Saharon Shelah
    Very weak zero one law for random graphs with order and random binary functions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:4, pp:351-358 [Journal]
  210. Saharon Shelah, Joel Spencer
    Can You Feel the Double Jump? [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:191-204 [Journal]
  211. Saharon Shelah, Joel Spencer
    Random Sparse Unary Predicates. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:375-394 [Journal]
  212. Yuri Gurevich, Saharon Shelah
    Expected Computation Time for Hamiltonian Path Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:486-502 [Journal]
  213. John T. Baldwin, Saharon Shelah
    On the Classifiability of Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:117-129 [Journal]
  214. Péter Komjáth, Saharon Shelah
    Finite subgraphs of uncountably chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:28-38 [Journal]
  215. Andrzej Roslanowski, Saharon Shelah
    Universal forcing notions and ideals. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2007, v:46, n:3-4, pp:179-196 [Journal]
  216. Heike Mildenberger, Saharon Shelah
    Increasing the groupwise density number by c.c.c. forcing. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:149, n:1-3, pp:7-13 [Journal]
  217. Matt Kaufmann, Saharon Shelah
    On random models of finite power and monadic logic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:3, pp:285-293 [Journal]

  218. Hereditary Zero-One Laws for Graphs. [Citation Graph (, )][DBLP]


  219. Strongly meager and strong measure zero sets. [Citation Graph (, )][DBLP]


  220. PCF and infinite free subsets in an algebra. [Citation Graph (, )][DBLP]


  221. More constructions for Boolean algebras. [Citation Graph (, )][DBLP]


  222. On the existence of large subsets of [lambda]kappa which contain no unbounded non-stationary subsets. [Citation Graph (, )][DBLP]


  223. Random graphs in the monadic theory of order. [Citation Graph (, )][DBLP]


  224. Possible size of an ultrapower of w\omega. [Citation Graph (, )][DBLP]


  225. The PCF Trichotomy Theorem does not hold for short sequences. [Citation Graph (, )][DBLP]


  226. On some configurations related to the Shelah Weak Hypothesis. [Citation Graph (, )][DBLP]


  227. The Karp complexity of unstable classes. [Citation Graph (, )][DBLP]


  228. Set theory without choice: not everything on cofinality is possible. [Citation Graph (, )][DBLP]


  229. The automorphism tower of a centerless group without Choice. [Citation Graph (, )][DBLP]


  230. More on SOP1 and SOP2. [Citation Graph (, )][DBLP]


  231. Filtration-equivalent aleph1-separable abelian groups of cardinality aleph1. [Citation Graph (, )][DBLP]


  232. The Odd-Distance Plane Graph. [Citation Graph (, )][DBLP]


  233. What majority decisions are possible. [Citation Graph (, )][DBLP]


Search in 0.166secs, Finished in 0.172secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002