Changes

proposition <math>f\!</math> is to be a data-vector <math>\mathbf{x}\!</math> (a row of the table) on which a function <math>f\!</math> evaluates to true.

proposition <math>f\!</math> is to be a data-vector <math>\mathbf{x}\!</math> (a row of the table) on which a function <math>f\!</math> evaluates to true.

This manner of speaking makes sense to those who consider the ultimate meaning of a sentence to be not the logical proposition that it denotes but its truth value instead.  From the point of view, one says that any data-vector of this type (<math>k\!</math>-tuples of truth values) may be regarded as an "interpretation" of the proposition with <math>k\!</math> variables.   An interpretation that yields a value of true is then called a "model".

This manner of speaking makes sense to those who consider the ultimate meaning of

a sentence to be not the logical proposition that it denotes but its truth value

instead.  From the point of view, one says that any data-vector of this type

(k-tuples of truth values) may be regarded as an "interpretation" of the

proposition with k variables. An interpretation that yields a value

of true is then called a "model".

For the most threadbare kind of logical system that we find residing

For the most threadbare kind of logical system that we find residing in propositional calculus, this notion of model is almost too simple to deserve the name, yet it can be of service to fashion some form of continuity between the simple and the complex.

in propositional calculus, this notion of model is almost too simple

to deserve the name, yet it can be of service to fashion some form

of continuity between the simple and the complex.

 

===Note 3===

===Note 3===