Termination of derivations for minimal tense logic
It is known that loop checking and backtracking are extensively used in various non-classical logics. An efficient loop checking is obtained using a technique based on histories. In the paper a method for elimination of loop checking in backward proof search for minimal tense logic Kt is proposed. T...
Main Author: | Regimantas Pliuškevičius |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2009-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Subjects: | |
Online Access: | https://www.journals.vu.lt/LMR/article/view/17975 |
Similar Items
-
Logic of knowledge with infinitely many agents
by: Regimantas Pliuškevičius
Published: (2023-09-01) -
Cut-Free Gentzen Sequent Calculi for Tense Logics
by: Zhe Lin, et al.
Published: (2023-06-01) -
Specialization of derivations in modal logic S5
by: Aida Pliuškevičienė
Published: (2023-09-01) -
Restrictions for loop-check in sequent calculus for temporal logic
by: Adomas Birštunas
Published: (2008-12-01) -
Efficient decision procedure for Belief modality
by: Adomas Birštunas
Published: (2005-12-01)