|Abstract||Functions of type n are characteristic functions on n-ary relations. In Beyond the Frege Boundary , Keenan established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, where he called a function of type n reducible if it can be represented as a composition of functions of type 1 . We will give a normal form theorem for functions of type n , and use this to show that natural language has many examples of irreducible type n functions in a much stronger sense, where we take a function to be reducible if it can be represented as a composition of functions of lower types.|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Martin Hofmann (1997). An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras. Bulletin of Symbolic Logic 3 (4):469-486.
Nick Chater (1997). What is the Type-1/Type-2 Distinction? Behavioral and Brain Sciences 20 (1):68-69.
Kc Klement (2010). The Senses of Functions in the Logic of Sense and Denotation. The Bulletin of Symbolic Logic 16 (2):153-188.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
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.
Added to index2009-01-28
Total downloads4 ( #188,906 of 722,871 )
Recent downloads (6 months)1 ( #60,917 of 722,871 )
How can I increase my downloads?