Abstract
An extension of the propositional temporal language is introduced with a simple syntactic device, called ”reference pointer” which provides for making references within a formula to ”instants of reference” specified in the formula. The language with reference pointers \(\mathcal{L}_{trp}\) has a great expressive power (e.g. Kamp's and Stavi's operators as well as Prior's clock variables are definable in it), especially compared to its frugal syntax, perspicuous semantics and simple deductive system. The minimal temporal logic K trp of this language is axiomatized and strong completeness theorem is proved for it and extended to an important class of extensions of K trp . The validity in \(\mathcal{L}_{trp}\) is proved undecidable.
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.
