Functional predicate: Difference between revisions

Revision as of 11:24, 11 August 2004

Revision as of 11:25, 11 August 2004

Line 10:

Now consider a model of the formal language, with the types '''T''' and '''U''' modelled by [[set]]s ['''T'''] and ['''U'''] and each symbol ''X'' of type '''T''' modelled by an element [''X''] in ['''T'''].

Then ''F'' can be modelled by the set

: <math>[F]:=\big\{([X],[F(X)]):[X]\in[\mathbf{T}]\big\},</math>

which is simply a [[function (mathematics)|function]] with ___domain ['''T'''] and codomain ['''U'''].

It is a requirement of a consistent model that [''F''(''X'')] = [''F''(''Y'')] whenever [''X''] = [''Y''].