There is no recursive link between the k-size of a model and its cardinality

Annals of Pure and Applied Logic 118 (3):235-247 (2002)
  Copy   BIBTEX

Abstract

Anuj Dawar poses two questions which give finitary analogies to the Löwenheim–Skolem theorems. Grohe , has shown that the first of these, which corresponds to the downward Löwenheim–Skolem theorem, has a negative answer. In this paper we combine Grohe's technique with that of Robinson's famous paper ) to show that the second question, which corresponds to the upward Löwenheim–Skolem theorem, also has a negative answer

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,471

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

A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Hanf number of omitting type for simple first-order theories.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (3):319-324.
Tiny models of categorical theories.M. C. Laskowski, A. Pillay & P. Rothmaler - 1992 - Archive for Mathematical Logic 31 (6):385-396.
Mapping a set of reals onto the reals.Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):575-584.
A model with no magic set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
T-Height in Weakly O-Minimal Structures.James Tyne - 2006 - Journal of Symbolic Logic 71 (3):747 - 762.

Analytics

Added to PP
2014-01-16

Downloads
10 (#1,201,046)

6 months
5 (#649,144)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references