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



    Upload a copy of this work     Papers currently archived: 100,497

External links

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

Through your library

Analytics

Added to PP
2010-08-24

Downloads
93 (#223,521)

6 months
11 (#320,308)

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