Skip to main content

Part of the book series: Synthese Library ((SYLI,volume 373))

Abstract

This paper presents shadow theory, according to which, for every object of some type, σ – object in the broadest sense of the term, including truth values and functions – there is another object of the same type, the negative shadow of the object, and for every (finite or infinite) set of objects of a single type, σ, there are two other objects of the same type, the conjunctive shadow and the disjunctive shadow of the set. For instance, Adam has his negative shadow, not-Adam, and Adam and Betty have their conjunctive and disjunctive shadows, Adam-and-Betty and Adam-or-Betty. These are negative, conjunctive, and disjunctive objects in the sense in which they distribute over the objects of one type higher, \(\sigma \rightarrow t\), where t is the type of truth values; thus, for instance, Adam-or-Betty is a professor if and only if Adam is a professor or Betty is a professor. The shadows of the same type are divided into infinitely many ranks. The usual infinite hierarchy of types, σ, \(\sigma \rightarrow t\), \((\sigma \rightarrow t) \rightarrow t\), \(((\sigma \rightarrow t) \rightarrow t) \rightarrow t\), \((((\sigma \rightarrow t) \rightarrow t) \rightarrow t) \rightarrow t\), …, are reducible to the bottom two types, σ and \(\sigma \rightarrow t\), with the rank distinction among shadows; thus, shadows help simplify type theory. This paper also presents a deductive system based on shadow theory that can be used for the formalization of natural language inferences that involve compound noun phrases and quantifiers. Unlike in Montague’s theory or generalized quantifier theory, in this theory such expressions denote objects (shadows) of type e, the type of individuals. There is no essential difference between quantification over individuals (or objects in general) and denotations to them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akiba, K. 2009. A new theory of quantifiers and term connectives. Journal of Logic, Language and Information 18: 403–431.

    Article  Google Scholar 

  2. Akiba, K. 2014. Boolean-valued sets as vague sets. In Vague objects and vague identity, ed. K. Akiba and A. Abasnezhad, 175–195. Dordrecht: Springer.

    Chapter  Google Scholar 

  3. Barwise, J., and R. Cooper. 1981. Generalized quantifiers and natural language. Linguistics and Philosophy 4: 159–219.

    Article  Google Scholar 

  4. Church, A. 1940. A formulation of the simple theory of types. Journal of Symbolic Logic 5: 56–68.

    Article  Google Scholar 

  5. Kripke, S. 1980. Naming and necessity. Cambridge: Harvard University Press.

    Google Scholar 

  6. Lewis, D. 1970. General semantics. Synthese 22: 18–67.

    Article  Google Scholar 

  7. Montague, R. 1973. The proper treatment of quantification in ordinary English. In Approaches to natural language, ed. J. Hintikka, J. Moravcsik, and P. Suppes, 221–242. Dordrecht: Reidel.

    Chapter  Google Scholar 

  8. Parigot, M. 1992. λ μ-calculus: an algorithmic interpretation of classical natural deduction. In Logic programming and automated reasoning: international conference, LPAR ’92. Lecture notes in artificial intelligence, vol. 624, ed. A. Voronkov, 190–201. Dordrecht: Springer.

    Chapter  Google Scholar 

  9. Partee, B. 1986. Noun phrase interpretation and type-shifting principles. In Studies in discourse representation theory and the theory of generalized quantifiers, ed. J. Groenendijik, D. de Jongh, and M. Stokhof, 115–143. Dordrecht: Foris.

    Chapter  Google Scholar 

  10. Partee, B., and M. Rooth. 1983. Generalized conjunction and type ambiguity. In Meaning, use and interpretation of language, ed. R. Bäuerle, C. Schwarze, and A. von Stechow, 361–383. Berlin: Walter de Gruyter.

    Google Scholar 

  11. Russell, B. 1905. On denoting. Mind 14: 479–493.

    Article  Google Scholar 

  12. Sørensen, M.H., and P. Urzyczyn. 2006. Lectures on the Curry-Howard isomorphism. Amsterdam: Elsevier.

    Google Scholar 

  13. Tarski, A. 1956. The concept of truth in formalized languages. In Logic, semantics, metamathematics, ed. A. Tarski, 152–278. Oxford: Oxford University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ken Akiba .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Akiba, K. (2015). Conjunctive, Disjunctive, Negative Objects and Generalized Quantification. In: Torza, A. (eds) Quantifiers, Quantifiers, and Quantifiers: Themes in Logic, Metaphysics, and Language. Synthese Library, vol 373. Springer, Cham. https://doi.org/10.1007/978-3-319-18362-6_5

Download citation

Publish with us

Policies and ethics