Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the complexity of the satisfiability problem for a class of logical formulae called iterated propositional schemata, modelling infinite sequences of structurally similar propositional formulae.  prove that the problem is EXPSPACE-complete in general and PSPACE-complete if the numbers occurring in the formula are polynomially bounded by the size of the schema.  then consider more restricted classes:  prove that the problem is still PSPACE-complete for the Horn class, but only NP-complete for the Krom class (sets of clauses of length 2). Finally,  devise a simple criterion ensuring that the satisfiability problem is in P.
['Nicolas Peltier']
I am writing a research paper on a idea Tractable and intractable classes of propositional schemata
[{"from": "human", "value": "I am writing a research paper on a idea Tractable and intractable classes of propositional schemata"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the complexity of the satisfiability problem for a class of logical formulae called iterated propositional schemata, modelling infinite sequences of structurally similar propositional formulae.  prove that the problem is EXPSPACE-complete in general and PSPACE-complete if the numbers occurring in the formula are polynomially bounded by the size of the schema.  then consider more restricted classes:  prove that the problem is still PSPACE-complete for the Horn class, but only NP-complete for the Krom class (sets of clauses of length 2). Finally,  devise a simple criterion ensuring that the satisfiability problem is in P."}]