Normal forms for characteristic functions on n-ary relations
| Abstract | Functions of type n are characteristic functions on n-ary relations. Keenan [5] established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, i.e., functions of type n that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker [3] improved on these by proposing an invariance condition that characterizes the functions with a reducible counterpart with the same behaviour on product relations. The present paper generalizes the notion of reducibility (a quantifier is reducible if it can be represented as a composition of quantifiers of lesser, but not necessarily unary, types), proposes a direct criterion for reducibility, and establishes a diamond theorem and a normal form theorem for reduction. These results are then used to show that every positive n function has a unique representation as a composition of positive irreducible functions, and to give an algorithm for finding this representation. With these formal tools it can be established that natural language has examples of n-ary quantificational expressions that cannot be reduced to any composition of quantifiers of lesser degree. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesGerald J. Massey (1968). Normal Form Generation of ${\Rm S}5$ Functions Via Truth Functions. Notre Dame Journal of Formal Logic 9 (1):81-85.
Glenn Parsons (2004). Natural Functions and the Aesthetic Appreciation of Inorganic Nature. British Journal of Aesthetics 44 (1):44-56.
C. J. Nix & J. B. Paris (2007). A Note on Binary Inductive Logic. Journal of Philosophical Logic 36 (6):735 - 771.
George Bealer (1989). On the Identification of Properties and Propositional Functions. Linguistics and Philosophy 12 (1):1 - 14.
Paul Oppenheimer & Edward N. Zalta (2011). Relations Vs Functions at the Foundations of Logic: Type-Theoretic Considerations. Journal of Logic and Computation 21:351-374.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #275,053 of 549,754 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
