Skip to main content
Log in

Onκ-complete reduced products

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • [Be] Benda, M.: On reduced products and filters. Ann. Math. Logic4, 1–29 (1972)

    Google Scholar 

  • [CK] Chang, C.C., Keisler, H.J.: Model theory. Amsterdam: North-Holland 1973

    Google Scholar 

  • [HR] Hintikka, J., Rantala, V.: A new approach to infinitely deep languages. Ann. Math. Logic10, 95–115 (1976)

    Google Scholar 

  • [HS] Hodges, W., Shelah, S.: Infinite games and reduced products. Ann. Math. Logic20, 77–108 (1981)

    Google Scholar 

  • [Hy] Hyttinen, T.: Games and infinitary languages. Ann. Acad. Sci. Fenn. Ser. AI Diss.64 (1987)

  • [Ka] Karttunen, M.: Model theory for infinitely deep languages. Ann. Acad. Sci. Fenn. Ser. AI Diss.50 (1984)

  • [Ke] Keisler, H.J.: Ultraproducts and saturated models. Indagationes Math.29, 178–186 (1964)

    Google Scholar 

  • [NS] Nadel, M., Stavi, J.:L ∞λ-equivalence, isomorphism and potential isomorphism. Trans. Am. Math. Soc.236, 51–74 (1978)

    Google Scholar 

  • [S1] Shelah, S.: Classification of first order theories which have a structure theorem. Bull. Am. Math. Soc.12, 227–232 (1985)

    Google Scholar 

  • [S2] Shelah, S.: Classification theory, 2nd edn. Stud. Logic Found. Math.92. Amsterdam: North-Holland (to appear)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hyttinen, T. Onκ-complete reduced products. Arch Math Logic 31, 193–199 (1992). https://doi.org/10.1007/BF01269947

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01269947

Keywords

Navigation