Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: While proving a theorem from a set of axioms is undecidable in first order logic, recent development has produced several tools which serve as automated theorem provers. Hover, often these systems are too complex for a given problem. Their usefulness is outighed by the difficulty of learning a new tool or translating results into computer-readable form.   I describe tools developed in Prolog to partially characterize the shuffle-inclusion problem. These tools allod for rapid development of proofs with little intellectual overhead. While focused around a specific problem, the techniques described are general, and ll suited to many problems on discrete structures.
['Joey Eremondi']
I am writing a research paper on a idea The poor man's proof assistant: using prolog to develop formal language theoretic proofs
[{"from": "human", "value": "I am writing a research paper on a idea The poor man's proof assistant: using prolog to develop formal language theoretic proofs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: While proving a theorem from a set of axioms is undecidable in first order logic, recent development has produced several tools which serve as automated theorem provers. Hover, often these systems are too complex for a given problem. Their usefulness is outighed by the difficulty of learning a new tool or translating results into computer-readable form.   I describe tools developed in Prolog to partially characterize the shuffle-inclusion problem. These tools allod for rapid development of proofs with little intellectual overhead. While focused around a specific problem, the techniques described are general, and ll suited to many problems on discrete structures."}]