George S. Boolos. A proof of the Löwenheim-Skolem theorem. Notre Dame journal of formal logic, vol. 11 , pp. 76–78

Journal of Symbolic Logic 38 (3):519 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273054

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A proof of the Löwenheim-Skolem theorem.George S. Boolos - 1970 - Notre Dame Journal of Formal Logic 11 (1):76-78.
Review: George S. Boolos, A Proof of the Lowenheim-Skolem Theorem. [REVIEW]Warren D. Goldfarb - 1973 - Journal of Symbolic Logic 38 (3):519-519.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
Book Review: Geraldine Brady. From Peirce to Skolem:\ \ A Neglected Chapter in the History of Logic. [REVIEW]Albert C. Lewis - 2004 - Notre Dame Journal of Formal Logic 45 (4):247-256.
Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem.Ildikó Sain - 1988 - Notre Dame Journal of Formal Logic 29 (3):332-344.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Skolem and the löwenheim-skolem theorem: a case study of the philosophical significance of mathematical results.Alexander George - 1985 - History and Philosophy of Logic 6 (1):75-89.
Trees and finite satisfiability: proof of a conjecture of Burgess.George Boolos - 1984 - Notre Dame Journal of Formal Logic 25 (3):193-197.
Some Remarks on Finite Löwenheim‐Skolem Theorems.Martin Grohe - 1996 - Mathematical Logic Quarterly 42 (1):569-571.
In the shadows of the löwenheim-Skolem theorem: Early combinatorial analyses of mathematical proofs.Jan von Plato - 2007 - Bulletin of Symbolic Logic 13 (2):189-225.
The Complexity of Revision, Revised.G. Aldo Antonelli - 2002 - Notre Dame Journal of Formal Logic 43 (2):75-78.
Alphabetical order.George Boolos - 1988 - Notre Dame Journal of Formal Logic 29 (2):214-215.
George Boolos.Charles Parsons - 1999 - Notre Dame Journal of Formal Logic 40 (1):3-5.
$1$-consistency and the diamond. [REVIEW]George Boolos - 1985 - Notre Dame Journal of Formal Logic 26 (4):341-347.
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
2016-06-30

Downloads
45 (#360,675)

6 months
11 (#267,580)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Warren Goldfarb
Harvard University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references