𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quantification over the real numbers

✍ Scribed by Arthur I. Fine


Publisher
Springer Netherlands
Year
1968
Tongue
English
Weight
390 KB
Volume
19
Category
Article
ISSN
0031-8116

No coin nor oath required. For personal study only.

✦ Synopsis


IN RECENT publications Ruth Marcus has gone back to Russell to revive a way of reading quantified formulas? Where F is a formula with the single free variable 'x,' the suggestion is to read '(x)F' as 'every substitution instance of F is true' and to read '(3x)F' as 'at least one substitution instance of F is true.' While unpleasant to the ears, perhaps, Marcus points out that this way of rendering quantified formulas obviates some of the difficulties which have been raised by Strawson and, in the case of quantified modal logics, it provides an easy way of seeing that Ouine's charge of essentialism is not correct. In subsequent discussion s Quine has not accepted Marcus' suggestion as just another way of reading quantified formulas but has urged, rather, that this is a "new interpretation." According to Quine, it is indeed an interpretation which won't do and, among the reasons for that is the suggestion that it won't do for "the example of real numbers."

Let us see what is involved. We can suppose that F is a one-place predicate, that N is the class of names which may meaningfully be substituted in F. Call '(N:F)' the class of statements 'Fn' for n in N and let O be the class of objects to which the property (I, expressed by F can be applied. (We assume that each predicate "expresses" a property, but not necessarily the converse.) Consider the following two assertions:

( 1 ) All the statements in (N:F) are true.

(2) All the objects in O have property ~.


πŸ“œ SIMILAR VOLUMES


On Ξ£-definability without equality over
✍ Andrei S. Morozov; Margarita V. Korovina πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

## Abstract In [5] (1982) it has been shown that for first‐order definability over the reals there exists an effective procedure which by a finite formula with equality defining an open set produces a finite formula without equality that defines the same set. In this paper we prove that there exist

Two logical hierarchies of optimization
✍ Uffe Flarup; Klaus Meer πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 209 KB

## Dedicated to Professor GΓΌnter Asser on the occasion of his eightieth birthday We introduce and study certain classes of optimization problems over the real numbers. The classes are defined by logical means, relying on metafinite model theory for so called R-structures (see [12,11]). More precis