Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: An effective method for constructing minimal (in the sense described in this study) nonclausal resolution proof systems for Lukasiewicz logics is described. It is shown that every minimal resolution counterpart of the n-valued Lukasiewicz logic, n>2, has 2n verifiers, and a polynomial time algorithm to generate them is provided. >
['E. R. Harley', 'Zbigniew Stachniak']
I am writing a research paper on a idea Minimal resolution proof systems for finitely-valued Lukasiewicz logics
[{"from": "human", "value": "I am writing a research paper on a idea Minimal resolution proof systems for finitely-valued Lukasiewicz logics"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: An effective method for constructing minimal (in the sense described in this study) nonclausal resolution proof systems for Lukasiewicz logics is described. It is shown that every minimal resolution counterpart of the n-valued Lukasiewicz logic, n>2, has 2n verifiers, and a polynomial time algorithm to generate them is provided. >"}]