Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Statman@?s finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them. A direct method of constructing such a model is provided using a simple induction on the Bohm tree of the term.
['B. Srivathsan', 'Igor Walukiewicz']
I am writing a research paper on a idea An alternate proof of Statman's finite completeness theorem
[{"from": "human", "value": "I am writing a research paper on a idea An alternate proof of Statman's finite completeness theorem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Statman@?s finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them. A direct method of constructing such a model is provided using a simple induction on the Bohm tree of the term."}]