A labelled sequent system for tense logic Kt-Reference-Cited by-同舟云学术

A labelled sequent system for tense logic Kt

Published:1998 Issue: Volume: Page:71-82
ISSN:0302-9743
Container-title:Advanced Topics in Artificial Intelligence
language:
Short-container-title:

Author:

Bonnette Nicolette,Goré Rajeev

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0095042

Reference20 articles.

1. B Beckert and R Goré. Free variable tableaux for propositional modal logics. In Proc. TABLEAUX-97, LNCS 1227, pages 91–106. Springer, 1997.

2. N Bonnette and R Goré. A labelled sequent system for tense logic K t. Technical Report TR-ARP-1-1998, ARP, 1998. http://arp.anu.edu.au:80/ftp/techreports/1998/TR-ARP-1-1998.ps.gz.

3. B Beckert and J Posegga. leanT A P: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339–358, 1995.

4. M Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel, Dordrecht, Holland, 1983.

5. M Fitting. Leantap revisited. J. of Logic and Computation 8:33–47, 1998.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents;Lecture Notes in Computer Science;2019

2. Labelled Systems in Modal Logics;Natural Deduction, Hybrid Systems and Modal Logics;2010

3. CardS4: Modal Theorem Proving on Java Smartcards;Smart Card Programming and Security;2001

4. CardKt: Automated Multi-modal Deduction on Java Cards for Multi-application Security;Lecture Notes in Computer Science;2001

5. Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?;Lecture Notes in Computer Science;1999