Comparing notions of similarity for uncountable models

Journal of Symbolic Logic 60 (4):1153-1167 (1995)
  Copy   BIBTEX

Abstract

The present article, which is a revised version of part of [Hu1], deals with various relations between models which might serve as exact formulations for the vague concept "similar" or "almost isomorphic". One natural class of such formulations is equivalence in a given logic. Another way to express similarity is by potential isomorphism, i.e., isomorphism in some extension of the set-theoretic universe. The class of extensions may be restricted to give different notions of potential isomorphism. A third method is to study the winning strategies for an Ehrenfeucht-Fraisse-game played between the two models, and the properties of the resulting equivalence and nonequivalence trees. The basic question studied here is whether one such notion of similarity implies another. Some implications and counterexamples listed in this part are previously known or trivial, but all are mentioned for completeness' sake. Only models of cardinality ℵ 1 are considered. Some results are therefore connected with the Continuum Hypothesis

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

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

Through your library

Similar books and articles

Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Scientific representation: Against similarity and isomorphism.Mauricio Suárez - 2003 - International Studies in the Philosophy of Science 17 (3):225-244.
Exhuming similarity.Dedre Gentner - 2001 - Behavioral and Brain Sciences 24 (4):669-669.
The rules versus similarity distinction.Emmanuel M. Pothos - 2005 - Behavioral and Brain Sciences 28 (1):1-14.

Analytics

Added to PP
2009-01-28

Downloads
42 (#361,008)

6 months
10 (#219,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Game-theoretic inductive definability.Juha Oikkonen & Jouko Väänänen - 1993 - Annals of Pure and Applied Logic 65 (3):265-306.
Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 105--138.
Small nonisomorphic models can be equivalent in long games.Taneli Huuskonen - 1991 - Bulletin of the Section of Logic 20 (3/4):105-106.

Add more citations

References found in this work

Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Large Infinitary Languages. Model Theory.Michael Makkai - 1978 - Journal of Symbolic Logic 43 (1):144-145.

Add more references