Hostname: page-component-6bb9c88b65-s7dlb Total loading time: 0 Render date: 2025-07-25T14:29:01.879Z Has data issue: false hasContentIssue false
  • English
  • Français

Constructing strongly equivalent nonisomorphic models for unsuperstable theories. Part B

Published online by Cambridge University Press:  12 March 2014

Tapani Hyttinen  and
Saharon Shelah
Tapani Hyttinen
Affiliation:
Department of Mathematics, University of Helsinki, 00014 Helsinki, Finland
Saharon Shelah
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem, Israel Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903
Get access Rights & Permissions [Opens in a new window]

Abstract

We study how equivalent nonisomorphic models of unsuperstable theories can be. We measure the equivalence by Ehrenfeucht-Fraïssé games. This paper continues [HS].

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 60 , Issue 4 , December 1995 , pp. 1260 - 1272
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[HS]Hyttinen, T. and Shelah, S., Constructing strongly equivalent nonisomorphic models for unsuperstable theories, Part A, this Journal, vol. 59 (1994), pp. 984–996.Google Scholar
[HT]Hyttinen, T. and Tuuri, H., Constructing strongly equivalent nonisomorphic models for unstable theories, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 203–248.CrossRefGoogle Scholar
[Hu]Huuskonen, T., Comparing notions of similarity for uncountable models, Dissertation, University of Helsinki, Helsinki, 1991.Google Scholar
[Shl]Shelah, S., Classification theory and the number of nonisomorphic models, 2nd rev. ed., North-Holland, Amsterdam, 1990.Google Scholar
[Sh2]Shelah, S., Non-structure theory (to appear).Google Scholar