Admissible sets and the saturation of structures

Annals of Mathematical Logic 14 (2):111 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-17

Downloads
8 (#1,336,069)

6 months
3 (#1,208,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
Saturated structures, unions of chains, and preservation theorems.Alan Adamson - 1980 - Annals of Mathematical Logic 19 (1-2):67-96.
A Spector-Gandy theorem for cPC d () classes.Shaughan Lavine - 1992 - Journal of Symbolic Logic 57 (2):478-500.
Applications of Fodor's lemma to Vaught's conjecture.Mark Howard - 1989 - Annals of Pure and Applied Logic 42 (1):1-19.

View all 6 citations / Add more citations

References found in this work

Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
Countable models of set theories.Harvey Friedman - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 539--573.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.

View all 7 references / Add more references