<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://glottopedia.org/index.php?action=history&amp;feed=atom&amp;title=Lambda-operator</id>
	<title>Lambda-operator - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://glottopedia.org/index.php?action=history&amp;feed=atom&amp;title=Lambda-operator"/>
	<link rel="alternate" type="text/html" href="http://glottopedia.org/index.php?title=Lambda-operator&amp;action=history"/>
	<updated>2026-04-22T17:51:20Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.34.2</generator>
	<entry>
		<id>http://glottopedia.org/index.php?title=Lambda-operator&amp;diff=7884&amp;oldid=prev</id>
		<title>Wohlgemuth: utrecht</title>
		<link rel="alternate" type="text/html" href="http://glottopedia.org/index.php?title=Lambda-operator&amp;diff=7884&amp;oldid=prev"/>
		<updated>2009-02-16T20:00:04Z</updated>

		<summary type="html">&lt;p&gt;utrecht&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Lambda-operator''' is an [[operator]] which makes it possible to construct expressions which denote [[predicate]]s or [[function]]s. Adding the lambda-operator to [[predicate logic]] makes it possible to construct predicates from formulae with free variables.&lt;br /&gt;
&lt;br /&gt;
=== Example ===&lt;br /&gt;
&lt;br /&gt;
two expressions with lambda-operators are given in (i):&lt;br /&gt;
&lt;br /&gt;
 (i)   a  lambda x [ kiss(john,x) ]&lt;br /&gt;
       b  lambda x [ man(x) &amp;amp;amp; Neg married(x) ]&lt;br /&gt;
&lt;br /&gt;
The lambda-expression in (i)a denotes the property of being kissed by John, the one in (i)b denotes the property of being an unmarried man. The lambda-operator plays an important role in [[type logic]], as a mechanism for making functions. If e is an expression of arbitrary type ''b'' and v is a variable of arbitrary type ''a'', then lambda v [ e ] is an expression of type &amp;amp;lt;''a'',''b''&amp;amp;gt;, i.e. a function from things of type ''a'' to things of type ''b''. The lambda-operator makes it possible to give a logical translation of every expression, including quantified noun phrases:&lt;br /&gt;
&lt;br /&gt;
 (ii)  a  every boy&lt;br /&gt;
       b  lambda P [ All(x) [ boy(x) -&amp;amp;gt; P(x) ]]&lt;br /&gt;
&lt;br /&gt;
The noun phrase in (ii)a is translated into a logical expression denoting a function from properties to truth values, assigning the value 1 to those properties that every boy has. When we combine the noun phrase in (ii)a with a predicate like ''walk'', then the expression in (ii)b is applied to the translation of ''walk''. In other words: the translation of (iii)a is (iii)b which is logically equivalent with (iii)c (an equivalence which follows from the semantics of the lambda-operator):&lt;br /&gt;
&lt;br /&gt;
 (iii) a	 Every boy walks&lt;br /&gt;
       b	 lambda P [ All(x) [ boy(x) -&amp;amp;gt; P(x) ]] (walk)&lt;br /&gt;
       c	 All(x) [ boy(x) -&amp;amp;gt; walk(x) ]&lt;br /&gt;
&lt;br /&gt;
=== Link ===&lt;br /&gt;
&lt;br /&gt;
[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Lambda-operator&amp;amp;lemmacode=581 Utrecht Lexicon of Linguistics]&lt;br /&gt;
&lt;br /&gt;
=== References ===&lt;br /&gt;
&lt;br /&gt;
* Gamut, L.T.F. 1991. ''Logic, language, and meaning,'' Univ. of Chicago Press, Chicago.&lt;br /&gt;
&lt;br /&gt;
{{dc}}&lt;br /&gt;
[[Category:Semantics]]&lt;/div&gt;</summary>
		<author><name>Wohlgemuth</name></author>
		
	</entry>
</feed>