Switch to: References

Add citations

You must login to add citations.
  1. Meeting of the Association for Symbolic Logic, Marseilles, 1981.J. Stern - 1983 - Journal of Symbolic Logic 48 (4):1210-1232.
  • Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
  • Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
  • Large resplendent models generated by indiscernibles.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (4):1382-1388.
  • Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
    §0. Introduction. In [16], Barwise described his graduate study at Stanford. He told of his interactions with Kreisel and Scott, and said how he chose Feferman as his advisor. He began working on admissible fragments of infinitary logic after reading and giving seminar talks on two Ph.D. theses which had recently been completed: that of Lopez-Escobar, at Berkeley, on infinitary logic [46], and that of Platek [58], at Stanford, on admissible sets.Barwise's work on infinitary logic and admissible sets is described (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Set theory with a Filter quantifier.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (2):263-287.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Applications of Fodor's lemma to Vaught's conjecture.Mark Howard - 1989 - Annals of Pure and Applied Logic 42 (1):1-19.
  • Expansions of models of ω-stable theories.Steven Buechler - 1984 - Journal of Symbolic Logic 49 (2):470-477.
    We prove that every relation-universal model of an ω-stable theory is saturated. We also show there is a large class of ω-stable theories for which every resplendent model is homogeneous.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark