Abstract
The object of our study is the propositional linear temporal logic LTL with operations Until and Next.We deal with inference rules admissible in LTL. Earlier the decidability of LTLw.r.t. to admissibility was shown. That, in particular, allowed to suggest a recursive infinite basis for admissible rules. However, that result gives no information about the structure and properties of such basis, thereby not allowing to use it for inferences. The current article aims to cover this gap and to provide an explicit (infinite) basis for rules admissible in LTL.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
