Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modal μ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-theoretical side. Nevertheless, axiomatizations have been given for both linear and branching time μ-calculi, with quite involved completeness arguments.  come back to this central problem, considering it from a proof search viewpoint, and provide some new completeness arguments in the linear time μ-calculus. Our results only deal with restricted classes of formulas that closely correspond to (non-alternating) ω-automata but, compared to earlier proofs, our completeness arguments are direct and constructive.  first consider a natural circular proof system based on sequent calculus, and show that it is complete for inclusions of parity automata expressed as formulas, making use of Safra's construction directly in proof search.  then consider the corresponding finitary proof system, featuring (co)induction rules, and provide a partial translation result from circular to finitary proofs. This yields completeness of the finitary proof system for inclusions of sufficiently deterministic parity automata, and finally for arbitrary Buchi automata.
['Amina Doumane', 'David Baelde', 'Lucca Hirschi', 'Alexis Saurin']
I am writing a research paper on a idea Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions
[{"from": "human", "value": "I am writing a research paper on a idea Towards Completeness via Proof Search in the Linear Time \u03bc-calculus: The case of B\u00fcchi inclusions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Modal \u03bc-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-theoretical side. Nevertheless, axiomatizations have been given for both linear and branching time \u03bc-calculi, with quite involved completeness arguments.  come back to this central problem, considering it from a proof search viewpoint, and provide some new completeness arguments in the linear time \u03bc-calculus. Our results only deal with restricted classes of formulas that closely correspond to (non-alternating) \u03c9-automata but, compared to earlier proofs, our completeness arguments are direct and constructive.  first consider a natural circular proof system based on sequent calculus, and show that it is complete for inclusions of parity automata expressed as formulas, making use of Safra's construction directly in proof search.  then consider the corresponding finitary proof system, featuring (co)induction rules, and provide a partial translation result from circular to finitary proofs. This yields completeness of the finitary proof system for inclusions of sufficiently deterministic parity automata, and finally for arbitrary Buchi automata."}]