Skip to main content

Loop-Check Specification for a Sequent Calculus of Temporal Logic

Studia Logica volume 110, pages 1507–1536 (2022)Cite this article

Abstract

In our previous work we have introduced loop-type sequent calculi for propositional linear discrete tense logic and proved that these calculi are sound and complete. Decision procedures using the calculi have been constructed for the considered logic. In the present paper we restrict ourselves to the logic with the unary temporal operators “next” and “henceforth always”. Proof-theory of the sequent calculus of this logic is considered, focusing on loop specification in backward proof-search. We describe cyclic sequents and prove that any loop consists of only cyclic sequents. A class of sequents for which backward proof-search do not require loop-check is presented. It is shown how sequents can be coded by binary strings that are used in backward proof-search for the sake of more efficient loop-check.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

References

  1. Afshari, B., and G. E. Leigh, Cut-free completeness for modal mu-calculus, in 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 2017, pp. 1–12.

  2. Alonderis, R., R. Pliuškevičius, A. Pliuškevičienė, and H. Giedra, Loop-type sequent calculi for temporal logic, Journal of Automated Reasoning 64(8):1663–1684, 2020.

  3. Andrikonis, J., and R. Pliuškevičius, Contraction-free calculi for modal logics S5 and KD45, Lietuvos matematikos rinkinys, LMD darbai 52:237–242, 2011.

    Google Scholar 

  4. Brodsky, I. N., Enthymeme reconstruction, Bulletin of Leningrad State University 6(1):40–44, 1988.

    Google Scholar 

  5. Brotherston, J., Cyclic proofs for first-order logic with inductive definitions, in TABLEAUX, vol. 3702 of Lecture Notes in Artificial Intelligence, Springer Verlag, 2005, pp. 78–92. https://doi.org/10.1007/11554554_8.

  6. Brünnler, K., and M. Lange, Cut-free sequent systems for temporal logic, The Journal of Logic and Algebraic Programming 76(2):216–225, 2008.

    Article  Google Scholar 

  7. Das, A., and D. Pous, A cut-free cyclic proof system for kleene algebra, in R.A. Schmidt, and C. Nalon, (eds.), Automated Reasoning with Analytic Tableaux and Related Methods–26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25–28, 2017, Proceedings, vol. 10501 of Lecture Notes in Computer Science, Springer, 2017, pp. 261–277.

  8. Dax, C., M. Hofmann, and M. Lange, A proof system for the linear time \(\mu \)-Calculus, in S. Arun-Kumar, and N. Garg, (eds.), FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, vol. 4337 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2006, pp. 273–284.

  9. Dyckhoff, R., Contraction free sequent calculi for intuitionistic logic, The Journal of Symbolic Logic 57(3):795–807, 1992.

    Article  Google Scholar 

  10. Hazard, E., and D. Kuperberg, Cyclic proofs for transfinite expressions, in F. Manea, and A. Simpson, (eds.), 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), vol. 216 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, pp. 23:1–23:18. https://doi.org/10.4230/LIPIcs.CSL.2022.23

  11. Heuerding, A., M. Seyfried, and H. Zimmermann, Efficient loop-check for backward proof search in some non-classical propositional logics, Lecture Notes in Computer Science 1071:210–225, 1996.

    Article  Google Scholar 

  12. Hudelmaier, J., A contraction-free sequent calculus for S4, in H. Wansing, (ed.), Proof Theory of Modal Logic, Kluwer Academic Publishers, 1996, pp. 3–15.

  13. Kokkinis, I., and T. Studer, Cyclic proofs for linear temporal logic, in D. Probst, and P. Schuster, (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, vol. 6 of Ontos Mathematical Logic, De Gruyter, 2016, pp. 171–192.

  14. Moukhachjov, V. P., and I. V. Netchitailov, An improvement of Brodsky’s coding method for the sequent calculus of first-order logic, in Logic Joint International Conference of Automated Reasoning, Siena, Italy, 18–25 June, 2001, pp. 113–121.

  15. Nide, N., and S. Takata, Deduction systems for BDI logic using sequent calculus, in AAMAS ’02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, Association for Computing Machinery, New York, 2002, pp. 928–935.

  16. Paech, B., Gentzen-systems for propositional temporal logics, Lecture Notes in Computer Science 385:240–253, 1988.

    Article  Google Scholar 

  17. Pliuškevičius, R., Investigation of fininitary calculi for temporal logics by means on infinitary calculi, Lecture Notes in Computer Science 452:464–469, 1990.

    Article  Google Scholar 

  18. Pliuškevičienė, A., Decision procedure for a fragment of dynamic logic, Lithuanian Mathematical Journal, special issue 41: 413–420, 2001.

    Google Scholar 

  19. Pliuškevičius, R., and A. Pliuškevičienė, Decision procedure for a fragment of mutual belief logic with quantified agent variables, Lecture Notes in Artificial Intelligence 3900:112–128, 2006.

    Google Scholar 

  20. Sundholm, G., A completeness proof for an infinitary tense-logic, Theoria 43:47–51, 1977. https://doi.org/10.1111/j.1755-2567.1977.tb00778.x

    Article  Google Scholar 

  21. Tellez, G., and J. Brotherston, Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof, Journal of Automated Reasoning 64:555–578, 2020. https://doi.org/10.1007/s10817-019-09532-0

    Article  Google Scholar 

  22. Wolper, P., The tableau method for temporal logic: An overview, Logique et Analyse 28:119–136, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vilnius University Institute of Data Science and Digital Technologies, Akademijos 4, Vilnius, 2600, Lithuania

    Romas Alonderis, Regimantas Pliuškevičius & Aida Pliuškevičienė

  2. Vilnius University Institute of Computer Science, Didlaukio st. 47, LT-08303, Vilnius, Lithuania

    Haroldas Giedra

Authors
  1. Romas Alonderis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Regimantas Pliuškevičius
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aida Pliuškevičienė
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Haroldas Giedra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Romas Alonderis.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Presented by Jacek Malinowski; Received January 20, 2022.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Alonderis, R., Pliuškevičius, R., Pliuškevičienė, A. et al. Loop-Check Specification for a Sequent Calculus of Temporal Logic. Stud Logica 110, 1507–1536 (2022). https://doi.org/10.1007/s11225-022-10010-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-022-10010-9

Keywords

  • Temporal logics
  • Sequent calculi
  • Derivation loops