# Trying To Make The Problem A Bit Clearer

In the hopes of making it a bit clearer why it is a problem, let me restate the question that I think the Relational Algebra will resolve.

So far we have been modeling sentences in which nothing is left unspecified.  Chris invites AndrewLukas laughs.  How could we model, however, sentences such as Chris invited someone, Someone invited Andrew, Someone invited someone, Joe ate something, Someone laughed … sentences in which at least one of the “central participants in a situation” is left unspecified?

‘Somebody’, ‘someone’, ‘something’ and so on pose a problem for the model presented in the post The Verb Considered As A Function.  Sets always comprise definite, clear-cut individuals.  Since functions are sets of ordered pairs, the primary and recursive functions discussed so far are pairings of definite entities.  What would it mean anyway to have a function that included an indefinite or unknown, entity, as if some function could be pictured this way:

 (1) [[ laugh ]] = { → T, → F, Eva → F, → T, Lukas → T, Tina → T }

?

How would we model a sentence “Somebody laughed” that is true, and a corresponding sentence “Somebody laughed” that is false?