Abstract
The method of labelled tableaux for proof search in modal logics is extended and modified to give a labelled sequent system for the tense logic K t. Soundness and completeness proofs are sketched, and results of an initial lean Prolog implementation in the programming style of lean T A P are presented. The sequent system is modular in that small modifications capture any combination of the reflexive, transitive, euclidean, symmetric and serial extensions of K t.
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.
