386 found
Order:
Disambiguations:
Saharon Shelah [360]S. Shelah [47]
  1. Haim Judah & Saharon Shelah (1993). ▵13-Sets of Reals. Journal of Symbolic Logic 58 (1):72 - 80.
    We build models where all $\underset{\sim}{\triangle}^1_3$ -sets of reals are measurable and (or) have the property of Baire and (or) are Ramsey. We will show that there is no implication between any of these properties for $\underset{\sim}{\triangle}^1_3$ -sets of reals.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  2. Mirna Džamonja & Saharon Shelah (2003). Universal Graphs at the Successor of a Singular Cardinal. Journal of Symbolic Logic 68 (2):366-388.
    The paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are $\mu^{++}$ graphs on μ+ that taken jointly are universal for the graphs on μ+, while $2^{\mu^+} \gg \mu^{++}$ . The paper also addresses the general problem of obtaining a framework for consistency results at the (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  3. Menachem Kojman & Saharon Shelah (1992). Nonexistence of Universal Orders in Many Cardinals. Journal of Symbolic Logic 57 (3):875-891.
    Our theme is that not every interesting question in set theory is independent of ZFC. We give an example of a first order theory T with countable D(T) which cannot have a universal model at ℵ1 without CH; we prove in ZFC a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove--again in ZFC--that for a large class of cardinals there is no universal linear order (e.g. in every regular $\aleph_1 < (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  4. Tapani Hyttinen & Saharon Shelah (1994). Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part A. Journal of Symbolic Logic 59 (3):984-996.
    In this paper we prove a strong nonstructure theorem for κ(T)-saturated models of a stable theory T with dop. This paper continues the work started in [1].
    Direct download (13 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5. Tomek Bartoszynski, Jaime I. Ihoda & Saharon Shelah (1989). The Cofinality of Cardinal Invariants Related to Measure and Category. Journal of Symbolic Logic 54 (3):719-726.
    We prove that the following are consistent with ZFC. 1. 2 ω = ℵ ω 1 + K C = ℵ ω 1 + K B = K U = ω 2 (for measure and category simultaneously). 2. 2 ω = ℵ ω 1 = K C (L) + K C (M) = ω 2 . This concludes the discussion about the cofinality of K C.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6. Saharon Shelah (1979). Hanf Number of Omitting Type for Simple First-Order Theories. Journal of Symbolic Logic 44 (3):319-324.
    Let T be a complete countable first-order theory such that every ultrapower of a model of T is saturated. If T has a model omitting a type p in every cardinality $ then T has a model omitting p in every cardinality. There is also a related theorem, and an example showing the $\beth_\omega$ cannot be improved.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  7. G. Sageev & S. Shelah (1985). On the Structure of $\Operatorname{Ext}(a, \Mathbf{Z})$ in ZFC+. Journal of Symbolic Logic 50 (2):302 - 315.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  8. Saharon Shelah & Juris Steprāns (2001). The Covering Numbers of Mycielski Ideals Are All Equal. Journal of Symbolic Logic 66 (2):707-718.
    The Mycielski ideal M k is defined to consist of all sets $A \subseteq ^{\mathbb{N}}k$ such that $\{f \upharpoonright X: f \in A\} \neq ^Xk$ for all X ∈ [N] ℵ 0 . It will be shown that the covering numbers for these ideals are all equal. However, the covering numbers of the closely associated Roslanowski ideals will be shown to be consistently different.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  9. Renling Jin & Saharon Shelah (1994). The Strength of the Isomorphism Property. Journal of Symbolic Logic 59 (1):292-301.
    In § 1 of this paper, we characterize the isomorphism property of nonstandard universes in terms of the realization of some second-order types in model theory. In § 2, several applications are given. One of the applications answers a question of D. Ross in [this Journal, vol. 55 (1990), pp. 1233-1242] about infinite Loeb measure spaces.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10. Saharon Shelah (2000). Applications of PCF Theory. Journal of Symbolic Logic 65 (4):1624-1674.
    We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further T D (f). The sections can be read independently, although there are some minor dependencies.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  11.  35
    Vladimir Kanovei & Saharon Shelah (2004). A Definable Nonstandard Model of the Reals. Journal of Symbolic Logic 69 (1):159-164.
    We prove, in ZFC,the existence of a definable, countably saturated elementary extension of the reals.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  12. Saharon Shelah (1984). Diamonds, Uniformization. Journal of Symbolic Logic 49 (4):1022-1033.
    Assume G.C.H. We prove that for singular λ, □ λ implies the diamonds hold for many $S \subseteq \lambda^+$ (including $S \subseteq \{\delta:\delta \in \lambda^+, \mathrm{cf}\delta = \mathrm{cf}\delta = \mathrm{cf}\lambda\}$ . We also have complementary consistency results.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  13. Jaime I. Ihoda & Saharon Shelah (1989). Martin's Axioms, Measurability and Equiconsistency Results. Journal of Symbolic Logic 54 (1):78-94.
    We deal with the consistency strength of ZFC + variants of MA + suitable sets of reals are measurable (and/or Baire, and/or Ramsey). We improve the theorem of Harrington and Shelah [2] repairing the asymmetry between measure and category, obtaining also the same result for Ramsey. We then prove parallel theorems with weaker versions of Martin's axiom (MA(σ-centered), (MA(σ-linked)), MA(Γ + ℵ 0 ), MA(K)), getting Mahlo, inaccessible and weakly compact cardinals respectively. We prove that if there exists r ∈ (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  14. Alan H. Mekler & Saharon Shelah (1989). Uniformization Principles. Journal of Symbolic Logic 54 (2):441-459.
    It is consistent that for many cardinals λ there is a family of at least λ + unbounded subsets of λ which have uniformization properties. In particular if it is consistent that a supercompact cardinal exists, then it is consistent that ℵ ω has such a family. We have applications to point set topology, Whitehead groups and reconstructing separable abelian p-groups from their socles.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  15.  7
    Saharon Shelah (1991). Reflecting Stationary Sets and Successors of Singular Cardinals. Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  16.  3
    Saharon Shelah (1999). Categoricity for Abstract Classes with Amalgamation. Annals of Pure and Applied Logic 98 (1-3):261-294.
    Let be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS. We prove that for a suitable Hanf number gc0 if χ0 < λ0 λ1, and is categorical inλ1+ then it is categorical in λ0.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  17.  1
    Mirna Džamonja & Saharon Shelah (2004). On ◁∗-Maximality. Annals of Pure and Applied Logic 125 (1-3):119-158.
    This paper investigates a connection between the semantic notion provided by the ordering * among theories in model theory and the syntactic SOPn hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP2 and SOP1. It is shown here that SOP3 implies SOP2 implies SOP1. In Shelah's article 229) it was shown that SOP3 implies *-maximality and we prove here that *-maximality in a model of GCH implies a property called SOP2″. It has been (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  18. Andreas Blass, Yuri Gurevich & Saharon Shelah (2002). On Polynomial Time Computation Over Unordered Structures. Journal of Symbolic Logic 67 (3):1093-1125.
    This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time from fixpoint plus counting. We show (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19. Saharon Shelah (1980). Simple Unstable Theories. Annals of Mathematical Logic 19 (3):177-203.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   17 citations  
  20. Saharon Shelah & Simon Thomas (1997). The Cofinality Spectrum of the Infinite Symmetric Group. Journal of Symbolic Logic 62 (3):902-916.
    Let S be the group of all permutations of the set of natural numbers. The cofinality spectrum CF(S) of S is the set of all regular cardinals λ such that S can be expressed as the union of a chain of λ proper subgroups. This paper investigates which sets C of regular uncountable cardinals can be the cofinality spectrum of S. The following theorem is the main result of this paper. Theorem. Suppose that $V \models GCH$ . Let C be (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  21. Thomas Jech & Saharon Shelah (1990). Full Reflection of Stationary Sets Below ℵω. Journal of Symbolic Logic 55 (2):822 - 830.
    It is consistent that, for every n ≥ 2, every stationary subset of ω n consisting of ordinals of cofinality ω k , where k = 0 or k ≤ n - 3, reflects fully in the set of ordinals of cofinality ω n - 1 . We also show that this result is best possible.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  22. Rvszard Frankiewicz, Saharon Shelah & Paweł Zbierski (forthcoming). On Closed P-Sets with in the Ω. Journal of Symbolic Logic.
     
    Export citation  
     
    My bibliography   1 citation  
  23.  6
    Moti Gitik & Saharon Shelah (1989). On Certain Indestructibility of Strong Cardinals and a Question of Hajnal. Archive for Mathematical Logic 28 (1):35-42.
    A model in which strongness ofκ is indestructible under κ+ -weakly closed forcing notions satisfying the Prikry condition is constructed. This is applied to solve a question of Hajnal on the number of elements of {λ δ |2 δ <λ}.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  24. Saharon Shelah (1996). Toward Classifying Unstable Theories. Annals of Pure and Applied Logic 80 (3):229-255.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  25. Yuri Gurevich & Saharon Shelah (1996). On Finite Rigid Structures. Journal of Symbolic Logic 61 (2):549-562.
    The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L ω ∞,ω formula with counting quantifiers defines a linear order.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  26. Rami Grossberg & Saharon Shelah (1986). On the Number of Nonisomorphic Models of an Infinitary Theory Which has the Infinitary Order Property. Part A. Journal of Symbolic Logic 51 (2):302-322.
    Let κ and λ be infinite cardinals such that κ ≤ λ (we have new information for the case when $\kappa ). Let T be a theory in L κ +, ω of cardinality at most κ, let φ(x̄, ȳ) ∈ L λ +, ω . Now define $\mu^\ast_\varphi (\lambda, T) = \operatorname{Min} \{\mu^\ast:$ If T satisfies $(\forall\mu \kappa)(\exists M_\chi \models T)(\exists \{a_i: i Our main concept in this paper is $\mu^\ast_\varphi (\lambda, \kappa) = \operatorname{Sup}\{\mu^\ast(\lambda, T): T$ is a theory (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27.  6
    Adi Jarden & Saharon Shelah (2013). Non-Forking Frames in Abstract Elementary Classes. Annals of Pure and Applied Logic 164 (3):135-191.
    The stability theory of first order theories was initiated by Saharon Shelah in 1969. The classification of abstract elementary classes was initiated by Shelah, too. In several papers, he introduced non-forking relations. Later, Shelah [17, II] introduced the good non-forking frame, an axiomatization of the non-forking notion.We improve results of Shelah on good non-forking frames, mainly by weakening the stability hypothesis in several important theorems, replacing it by the almost λ-stability hypothesis: The number of types over a model of cardinality (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  28. Saharon Shelah & Alexander Usvyatsov (2008). More on SOP 1 and SOP 2. Annals of Pure and Applied Logic 155 (1):16-31.
    This paper continues the work in [S. Shelah, Towards classifying unstable theories, Annals of Pure and Applied Logic 80 229–255] and [M. Džamonja, S. Shelah, On left triangle, open*-maximality, Annals of Pure and Applied Logic 125 119–158]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the connection between maximality in the ordering left triangle, open* among complete first order theories and the SOP2 property. We (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  29.  1
    J. A. Makowsky, Saharon Shelah & Jonathan Stavi (1976). Δ-Logics and Generalized Quantifiers. Annals of Mathematical Logic 10 (2):155-192.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   14 citations  
  30. Saharon Shelah (1972). Uniqueness and Characterization of Prime Models Over Sets for Totally Transcendental First-Order Theories. Journal of Symbolic Logic 37 (1):107-113.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  31.  6
    Andrzej Rosłanowski & Saharon Shelah (2010). Reasonable Ultrafilters, Again. Notre Dame Journal of Formal Logic 52 (2):113-147.
    We continue investigations of reasonable ultrafilters on uncountable cardinals defined in previous work by Shelah. We introduce stronger properties of ultrafilters and we show that those properties may be handled in λ-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating systems of size less than $2^\lambda$ . We also show how ultrafilters generated by small systems can be killed by forcing notions which have enough (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  32.  2
    Victor Harnik, Terrence S. Millar, Michael L. Wage, Saharon Shelah, Helmut Schwichtenberg, Daniel Lascar, Bruno Poizat, Warren D. Goldfarb, On Carnap & Hugues Leblanc (2013). The Journal of Symbolic Logic Publishes Original Scholarly Work in Symbolic Logic. Founded in 1936, It has Become the Leading Research Journal in the Field. The Journal Aims to Represent Logic Broadly, Including its Connections with Mathematics and Philosophy as Well as Newer Aspects Related to Computer Science and Linguistics. [REVIEW] Journal of Symbolic Logic 309 (318).
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  33. Saharon Shelah (1987). Semiproper Forcing Axiom Implies Martin Maximum but Not |mathrmPFA+. Journal of Symbolic Logic 52 (2):360 - 367.
    We prove that MM (Martin maximum) is equivalent (in ZFC) to the older axiom SPFA (semiproper forcing axiom). We also prove that SPFA does not imply SPFA + or even PFA + (using the consistency of a large cardinal).
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  34.  8
    Haim Judah & Saharon Shelah (1990). The Kunen-Miller Chart (Lebesgue Measure, the Baire Property, Laver Reals and Preservation Theorems for Forcing). Journal of Symbolic Logic 55 (3):909-927.
    In this work we give a complete answer as to the possible implications between some natural properties of Lebesgue measure and the Baire property. For this we prove general preservation theorems for forcing notions. Thus we answer a decade-old problem of J. Baumgartner and answer the last three open questions of the Kunen-Miller chart about measure and category. Explicitly, in \S1: (i) We prove that if we add a Laver real, then the old reals have outer measure one. (ii) We (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  35.  26
    Uri Abraham & Saharon Shelah (1983). Forcing Closed Unbounded Sets. Journal of Symbolic Logic 48 (3):643-657.
    We discuss the problem of finding forcing posets which introduce closed unbounded subsets to a given stationary set.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  36.  11
    Martin Goldstern & Saharon Shelah (1995). The Bounded Proper Forcing Axiom. Journal of Symbolic Logic 60 (1):58-73.
    The bounded proper forcing axiom BPFA is the statement that for any family of ℵ 1 many maximal antichains of a proper forcing notion, each of size ℵ 1 , there is a directed set meeting all these antichains. A regular cardinal κ is called Σ 1 -reflecting, if for any regular cardinal χ, for all formulas $\varphi, "H(\chi) \models`\varphi'"$ implies " $\exists\delta . We investigate several algebraic consequences of BPFA, and we show that the consistency strength of the bounded (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  37.  6
    Saharon Shelah & Michael Makkai (1990). Categoricity of Theories in Lϰω, with Κ a Compact Cardinal. Annals of Pure and Applied Logic 47 (1):41-97.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  38.  2
    Saharon Shelah (1970). Finite Diagrams Stable in Power. Annals of Mathematical Logic 2 (1):69-118.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  39.  4
    Yuri Gurevich & Saharon Shelah (1986). Fixed-Point Extensions of First-Order Logic. Annals of Pure and Applied Logic 32 (3):265-280.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  40.  2
    Andreas Blass & Saharon Shelah (1987). There May Be Simple Pℵ1 and Pℵ2-Points and the Rudin-Keisler Ordering May Be Downward Directed. Annals of Pure and Applied Logic 33 (3):213-243.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  41.  14
    Heike Mildenberger & Saharon Shelah (2003). Specialising Aronszajn Trees by Countable Approximations. Archive for Mathematical Logic 42 (7):627-647.
    We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  42.  8
    Saharon Shelah & Pierre Simon (2012). Adding Linear Orders. Journal of Symbolic Logic 77 (2):717-725.
    We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)= A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a totally categorical theory for which every expansion by a linear order has IP. There is also an ω-stable NDOP theory for which every expansion by a linear order interprets pseudofinite arithmetic.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  43.  10
    John T. Baldwin & Saharon Shelah (2008). Examples of Non-Locality. Journal of Symbolic Logic 73 (3):765-782.
    We use κ-free but not Whitehead Abelian groups to constructElementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-types. We introduce the notion that an AEC admits intersections. We conclude that for AEC which admit intersections, the amalgamation property can have no positive effect on locality: there is a transformation of AEC's which preserves non-locality but takes any AEC which admits intersections to one with amalgamation. More specifically we have: Theorem 5.3. There is (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  44. Saharon Shelah, Heikki Tuuri & Jouko Väänänen (1993). On the Number of Automorphisms of Uncountable Models. Journal of Symbolic Logic 58 (4):1402-1418.
    Let σ(U) denote the number of automorphisms of a model U of power ω1. We derive a necessary and sufficient condition in terms of trees for the existence of an U with $\omega_1 < \sigma(\mathfrak{U}) < 2^{\omega_1}$. We study the sufficiency of some conditions for σ(U) = 2ω1 . These conditions are analogous to conditions studied by D. Kueker in connection with countable models.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  45.  7
    Uri Abraham & Saharon Shelah (1993). A Δ22 Well-Order of the Reals and Incompactness of L. Annals of Pure and Applied Logic 59 (1):1-32.
    A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  46.  23
    Todd Eisworth & Saharon Shelah (2005). Successors of Singular Cardinals and Coloring Theorems I. Archive for Mathematical Logic 44 (5):597-618.
  47.  37
    Tomek Bartoszyński, Andrzej Roslanowski & Saharon Shelah (2000). After All, There Are Some Inequalities Which Are Provable in ZFC. Journal of Symbolic Logic 65 (2):803-816.
    We address ZFC inequalities between some cardinal invariants of the continuum, which turned out to be true in spite of strong expectations given by [11].
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  48.  4
    J. A. Makowsky & S. Shelah (1983). Positive Results in Abstract Model Theory: A Theory of Compact Logics. Annals of Pure and Applied Logic 25 (3):263-299.
    We prove that compactness is equivalent to the amalgamation property, provided the occurrence number of the logic is smaller than the first uncountable measurable cardinal. We also relate compactness to the existence of certain regular ultrafilters related to the logic and develop a general theory of compactness and its consequences. We also prove some combinatorial results of independent interest.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  49.  23
    Uri Abraham & Saharon Shelah (2002). Coding with Ladders a Well Ordering of the Reals. Journal of Symbolic Logic 67 (2):579-597.
    Any model of ZFC + GCH has a generic extension (made with a poset of size ℵ 2 ) in which the following hold: MA + 2 ℵ 0 = ℵ 2 +there exists a Δ 2 1 -well ordering of the reals. The proof consists in iterating posets designed to change at will the guessing properties of ladder systems on ω 1 . Therefore, the study of such ladders is a main concern of this article.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  50. Menachem Magidor, Saharon Shelah & Jonathan Stavi (1983). On the Standard Part of Nonstandard Models of Set Theory. Journal of Symbolic Logic 48 (1):33-38.
    We characterize the ordinals α of uncountable cofinality such that α is the standard part of a nonstandard model of ZFC (or equivalently KP).
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 386