We must ask whether there is any interest
in these nonstandard models aside from the independence proof;
that is, do they have any mathematical interest?
The answer must be yes, but we cannot yet give a really good
coined the term “Boolean valued analysis” for applications of the models
Farkas Lemma, also known as the Farkas–Minkowski Lemma,
plays a key role in linear programming and the relevant areas of optimization.The aim of this talk is to demonstrate how Boolean valued analysis may
be applied to simultaneous linear inequalities with operators.
This particular theme is another illustration of the deep and powerful
technique of “stratified validity” which is characteristic of
Boolean valued analysis.
We definitely feel truth, but we cannot define truth properly.
That is what
Tarski explained to us in the 1930s.
We pursue truth by way of proof, as wittily phrased by
Model theory evaluates and counts truth and proof.
The chase of truth not only leads us close to the truth we pursue but also enables
us to nearly catch up with many other
instances of truth which we were not aware nor even foresaw at the start
of the rally pursuit. That is what we have learned from
the Boolean models elaborated in the 1960s by Scott,
1At the time, I was disappointed that no one took
up my suggestion. And then I was very surprised
much later to see the work of Takeuti and his
associates. I think the point is that people have
to be trained in Functional Analysis in order to
understand these models. I think this is also
obvious from your book and its references. Alas,
I had no students or collaborators with this kind
of background, and so I was not able to generate
Dana Scott's Letter of April 29, 2009 to S.S. Kutateladze.)