Applications of the Lowenheim-Skolem-Tarski Theorem to Problems of Completeness and Decidability

Journal of Symbolic Logic 24 (1):58 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Some Remarks on Finite Löwenheim‐Skolem Theorems.Martin Grohe - 1996 - Mathematical Logic Quarterly 42 (1):569-571.
There is no recursive link between the k-size of a model and its cardinality.R. Barker - 2002 - Annals of Pure and Applied Logic 118 (3):235-247.
Tarski-Vaught and Löwenheim-Skolem numbers.G. Weaver - 1975 - Logique Et Analyse 18 (69):103.
A Note on Applications of the Löwenheim-Skolem-Theorem in General Topology.Ingo Bandlow - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):283-288.

Analytics

Added to PP
2013-11-22

Downloads
48 (#339,852)

6 months
15 (#185,076)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dana Scott
Carnegie Mellon University

Citations of this work

Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.

Add more citations

References found in this work

No references found.

Add more references