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: 93,745

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

Tarski-Vaught and Löwenheim-Skolem numbers.G. Weaver - 1975 - Logique Et Analyse 18 (69):103.
On the theorem of Skolem-Lowenheim.Kinjiro Kungui & Arnaud Denjoy - 1956 - Journal of Symbolic Logic 21 (1):95-96.
A Proof of the Skolem-Löwenheim Theorem.H. Rasiowa & R. Sikorski - 1953 - Journal of Symbolic Logic 18 (4):339-340.

Analytics

Added to PP
2013-11-22

Downloads
41 (#112,661)

6 months
15 (#941,355)

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