Fr. 136.00

Eliminating The Universe: Logical Properties Of Natural Language

English · Hardback

Shipping usually within 3 to 5 weeks

Description

Read more










This book synthesizes the author's work (1980s-2015) on the logical expressive power of natural language. It extends the tools and concepts of model theory as used in (higher order) predicate logic to the study of natural language semantics. It focuses on boolean structure, generalized quantification (separated from variable binding), covering some cases of anaphora. Different categories - predicates, adjective, quantifiers - are modeled by non-isomorphic boolean lattices.
Of empirical linguistic interest is the expressibility of many natural classes of quantifiers defined in terms of their logical (automorphism invariant) properties. Some of these correlate with classes used syntactically in generative grammar. In other cases we find general (possibly universal) constraints on possible quantifier denotations in natural language.
Also of novel logical interest are entailment paradigms that depend on relations between pairs or triples of generalized quantifier denoting expressions, ones that are in some cases inherently vague. In addition we note novel binary quantifiers that lie beyond the "Frege boundary" in that they are provably not identical to any iterated application of unary quantifiers.
Of philosophical interest is the existence of models which make the same sentences true as standard models but which lack a universe and hence, seemingly, a notion of "reference". Moreover, these models generalize to ones in which we can represent (some) intensional expressions without the use of novel ontological objects, such as "possible worlds" or "propositions".

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.