10 found
Order:
  1. A Semantic Characterization of Natural Language Determiners.Edward L. Keenan & Jonathan Stavi - 1986 - Linguistics and Philosophy 9 (3):253 - 326.
  2.  24
    The Pure Part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
    Let M be a structure for a language L on a set M of urelements. HYP(M) is the least admissible set above M. In § 1 we show that pp(HYP(M)) [ = the collection of pure sets in HYP(M] is determined in a simple way by the ordinal α = ⚬(HYP(M)) and the $\mathscr{L}_{\propto\omega}$ theory of M up to quantifier rank α. In § 2 we consider the question of which pure countable admissible sets are of the form pp(HYP(M)) for (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3. On the Standard Part of Nonstandard Models of Set Theory.Menachem Magidor, Saharon Shelah & Jonathan Stavi - 1983 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  17
    Extensions of Kripke's Embedding Theorem.Jonathan Stavi - 1975 - Annals of Mathematical Logic 8 (4):345.
  5.  33
    On Models of the Elementary Theory of (Z + 1).Mark Nadel & Jonathan Stavi - 1990 - Journal of Symbolic Logic 55 (1):1-20.
  6.  5
    The Pure Part of $Mathrm{HYP}(Mathscr{M}$).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
    Let $\mathscr{M}$ be a structure for a language $\mathscr{L}$ on a set $M$ of urelements. $\mathrm{HYP}(\mathscr{M})$ is the least admissible set above $\mathscr{M}$. In $\S 1$ we show that $pp(\mathrm{HYP}(\mathscr{M})) \lbrack = \text{the collection of pure sets in} \mathrm{HYP}(\mathscr{M}\rbrack$ is determined in a simple way by the ordinal $\alpha = \circ(\mathrm{HYP}(\mathscr{M}))$ and the $\mathscr{L}_{\propto\omega}$ theory of $\mathscr{M}$ up to quantifier rank $\alpha$. In $\S 2$ we consider the question of which pure countable admissible sets are of the form $pp(\mathrm{HYP}(\mathscr{M}))$ for (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  16
    Countably Decomposable Admissible Sets.Menachem Magidor, Saharon Shelah & Jonathan Stavi - 1984 - Annals of Pure and Applied Logic 26 (3):287-361.
    The known results about Σ 1 -completeness, Σ 1 -compactness, ordinal omitting etc. are given a unified treatment, which yields many new examples. It is shown that the unifying theorem is best possible in several ways, assuming V = L.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  20
    ▵02 Operators and Alternating Sentences in Arithmetic.Larry Manevitz & Jonathan Stavi - 1980 - Journal of Symbolic Logic 45 (1):144 - 154.
  9.  17
    A Converse of the Barwise Completeness Theorem.Jonathan Stavi - 1973 - Journal of Symbolic Logic 38 (4):594-612.
  10.  8
    $Triangle^0_2$ Operators and Alternating Sentences in Arithmetic.Larry Manevitz & Jonathan Stavi - 1980 - Journal of Symbolic Logic 45 (1):144-154.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation