Unrestricted Quantification

Relatively Unrestricted Quantification

There are four broad grounds upon which the intelligibility of quantification over absolutely everything has been questioned—one based upon the existence of semantic indeterminacy, another on the relativity of ontology to a conceptual scheme, a third upon the necessity of sortal restriction, and the last upon the possibility of indefinite extendibility. The argument from semantic indeterminacy ...

Sets, Properties, and Unrestricted Quantification

Call a quantifier unrestricted if it ranges over absolutely all things: not just over all physical things or all things relevant to some particular utterance or discourse but over absolutely everything there is. Prima facie, unrestricted quantification seems to be perfectly coherent. For such quantification appears to be involved in a variety of claims that all normal human beings are capable o...

Constraint Programming with Unrestricted Quantification

Search problems occur widely in AI, and a number of generalpurpose constraint-based methods for solving them have been developed. Convenient modelling of many problems is enabled by use of quantifiers of various sorts, but the most prominent approaches support only limited use of quantifiers. A recently proposed constraint programming framework, based on classical logic and the notion of expans...

Unrestricted Loops

We present computer simulations to examine probability distributions of gyration radius for the no-thickness closed polymers of N straight segments of equal length. We are particularly interested in the conditional distributions when the topology of the loop is quenched to be a certain knot K. The dependence of probability distribution on length, N , as well as topological state K are the prima...

Unrestricted Warfare