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