Indenumerability and substitutional quantification

Notre Dame Journal of Formal Logic 23 (4):358-366 (1982)
  Copy   BIBTEX

Abstract

We here establish two theorems which refute a pair of what we believe to be plausible assumptions about differences between objectual and substitutional quantification. The assumptions (roughly stated) are as follows: (1) there is at least one set d and denumerable first order language L such that d is the domain set of no interpretation of L in which objectual and substitutional quantification coincide. (2) There exist interpreted, denumerable, first order languages K with indenumerable domains such that substitutional quantification deviates from objectual quantification in K and this deviance remains for all name extensions I of K. We show these assumptions have actually been made, and then prove the refuting theorems.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,556

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

Analytics

Added to PP
2010-08-24

Downloads
99 (#225,898)

6 months
11 (#329,698)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Philip Hugly
University of California, Berkeley (PhD)
Charles Sayward
University of Nebraska, Lincoln

References found in this work

No references found.

Add more references