Skip to main content
Top

2010 | OriginalPaper | Chapter

9. Logics of Linear Frames

Author : Dr. Andrzej Indrzejczak

Published in: Natural Deduction, Hybrid Systems and Modal Logics

Publisher: Springer Netherlands

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Logics of linear frames, called here for short linear logics form a particularly interesting and important class, especially in temporal interpretation. But we devote a separate Chapter for their treatment not because of their importance but rather because of special problems generated by their formalization in the setting of labelled systems.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
It shouldn't cause any misunderstanding, since in this book we do not deal with Girard's linear logic.
 
2
Note that we do not apply superscripts with “{” in monomodal case.
 
3
An additional effect of identifying a new state with every one already present.
 
4
The latter feature was in fact present also in our labelled rules for weak logics introduced in Section 8.​6.
 
5
Actually, it is performed for labelled KE-system with \((\nu 3^{\prime})\) not for LAND1 but that is not the point.
 
6
Analytic labelled system for these logics may be found in Leszczy'nska [175] but it is based on the rules of different character.
 
Literature
[18]
go back to reference Baldoni, M. 1998. Normal multimodal logics: Automatic deduction and logic programming extension PhD thesis, Torino. Baldoni, M. 1998. Normal multimodal logics: Automatic deduction and logic programming extension PhD thesis, Torino.
[288]
go back to reference Zeman, J.J. 1973. Modal logic. Oxford: Oxford University Press. Zeman, J.J. 1973. Modal logic. Oxford: Oxford University Press.
[63]
go back to reference Castellini, C. and A. Smaill. 2000. A systematic presentation of quantified modal logics. Logic Journal of the IGPL 10: 571–599.CrossRef Castellini, C. and A. Smaill. 2000. A systematic presentation of quantified modal logics. Logic Journal of the IGPL 10: 571–599.CrossRef
[47]
go back to reference Bolotov, A., A. Basukoski, O. Grigoriev, and V. Shangin. 2006. Natural deduction calculus for linear-time temporal logic. Proceedings of jelia 2006. LNAI, Springer 4160. Bolotov, A., A. Basukoski, O. Grigoriev, and V. Shangin. 2006. Natural deduction calculus for linear-time temporal logic. Proceedings of jelia 2006. LNAI, Springer 4160.
[118]
go back to reference Goubault-Larrecq J., and P.H. Schmitt. 1997. A tableau system for linear temporal logic. Proceedings of TACAS’97, 130–144, Springer. Goubault-Larrecq J., and P.H. Schmitt. 1997. A tableau system for linear temporal logic. Proceedings of TACAS’97, 130–144, Springer.
[183]
go back to reference Marx, M., S. Mikulas, and M. Reynolds. 2000. The mosaic method for temporal logics. In Automated reasoning with analytic tableaux and related methods, ed. R. Dyckhoff, Proc. of International Conference TABLEAUX 2000, Saint Andrews, Scotland, LNAI 1847, 324–340. New York: Springer. Marx, M., S. Mikulas, and M. Reynolds. 2000. The mosaic method for temporal logics. In Automated reasoning with analytic tableaux and related methods, ed. R. Dyckhoff, Proc. of International Conference TABLEAUX 2000, Saint Andrews, Scotland, LNAI 1847, 324–340. New York: Springer.
[116]
go back to reference Goré, R. 1992. Cut-free sequent and tableau systems for propositional normal modal logics, PhD thesis, University of Cambridge. Goré, R. 1992. Cut-free sequent and tableau systems for propositional normal modal logics, PhD thesis, University of Cambridge.
[60]
go back to reference Burgess, J.P. 1984. Basic tense logic. In Handbook of philosophical logic, eds. D. Gabbay, and F. Guenthner, vol II, 89–133. Dordrecht: Reidel Publishing Company. Burgess, J.P. 1984. Basic tense logic. In Handbook of philosophical logic, eds. D. Gabbay, and F. Guenthner, vol II, 89–133. Dordrecht: Reidel Publishing Company.
[161]
go back to reference Kashima, R. 1994. Cut-free sequent calculi for some tense logics. Studia Logica 53: 119–135.CrossRef Kashima, R. 1994. Cut-free sequent calculi for some tense logics. Studia Logica 53: 119–135.CrossRef
[281]
go back to reference Wansing, H. 2002. Sequent systems for modal logics. In Handbook of philosophical logic, eds. D. Gabbay, and F. Guenthner, vol IV, 89–133. Dordrecht: Reidel Publishing Company. Wansing, H. 2002. Sequent systems for modal logics. In Handbook of philosophical logic, eds. D. Gabbay, and F. Guenthner, vol IV, 89–133. Dordrecht: Reidel Publishing Company.
[231]
go back to reference Rescher, N., and A. Urquhart. 1971. Temporal logic. New York: Springer-Verlag. Rescher, N., and A. Urquhart. 1971. Temporal logic. New York: Springer-Verlag.
[151]
go back to reference Indrzejczak, A. 2003. A labelled natural deduction system for linear temporal logic. Studia Logica 75(3): 345–376.CrossRef Indrzejczak, A. 2003. A labelled natural deduction system for linear temporal logic. Studia Logica 75(3): 345–376.CrossRef
[88]
go back to reference Fisher, M., C. Dixon, and M. Peim. 2001. Clausal temporal resolution. ACM Transactions on Computational Logic 1(4). Fisher, M., C. Dixon, and M. Peim. 2001. Clausal temporal resolution. ACM Transactions on Computational Logic 1(4).
[149]
go back to reference Indrzejczak, A. 2002. Labelled analytic tableaux for S4.3. Bulletin of the Section of Logic 31(1): 15–26. Indrzejczak, A. 2002. Labelled analytic tableaux for S4.3. Bulletin of the Section of Logic 31(1): 15–26.
[146]
go back to reference Indrzejczak, A. 2000. Multiple sequent calculus for tense logics. Abstracts of AiML and ICTL 2000: 93–104, Leipzig. Indrzejczak, A. 2000. Multiple sequent calculus for tense logics. Abstracts of AiML and ICTL 2000: 93–104, Leipzig.
[280]
go back to reference Wansing, H. 1998. Displaying modal logics. Dordrecht: Kluwer Academic Publishers. Wansing, H. 1998. Displaying modal logics. Dordrecht: Kluwer Academic Publishers.
[284]
go back to reference Wolper, P. 1985. The tableau method for temporal logic: An overview. Logique et Analyse 28(110/111): 119–136. Wolper, P. 1985. The tableau method for temporal logic: An overview. Logique et Analyse 28(110/111): 119–136.
[140]
go back to reference Indrzejczak, A. 1994. Natural deduction system for tense logics. Bulletin of the Section of Logic 23(4): 173–179. Indrzejczak, A. 1994. Natural deduction system for tense logics. Bulletin of the Section of Logic 23(4): 173–179.
[177]
go back to reference Lichtenstein, O., and A. Pnueli. 2000. Propositional temporal logics: Decidability and completeness. Logic Journal of the IGPL 8(1): 55–85.CrossRef Lichtenstein, O., and A. Pnueli. 2000. Propositional temporal logics: Decidability and completeness. Logic Journal of the IGPL 8(1): 55–85.CrossRef
[64]
go back to reference Catach, L. 1991. TABLEAUX: A general theorem prover for modal logics. Journal of Automated Reasoning 7(4): 489–510, 1991.CrossRef Catach, L. 1991. TABLEAUX: A general theorem prover for modal logics. Journal of Automated Reasoning 7(4): 489–510, 1991.CrossRef
[252]
go back to reference Shimura, T. 1991. Cut-free systems for the modal logic S4.3 and S4.3GRZ. Reports on Mathematical Logic 25: 57–73. Shimura, T. 1991. Cut-free systems for the modal logic S4.3 and S4.3GRZ. Reports on Mathematical Logic 25: 57–73.
[112]
go back to reference Goldblatt, R.I. 1987. Logics of time and computation. Stanford: CSLI Lecture Notes. Goldblatt, R.I. 1987. Logics of time and computation. Stanford: CSLI Lecture Notes.
[104]
go back to reference Garson, J.W. 2005. Unifying quantified modal logic. Journal of Philosophical Logic 34: 621–649.CrossRef Garson, J.W. 2005. Unifying quantified modal logic. Journal of Philosophical Logic 34: 621–649.CrossRef
[194]
go back to reference Negri, S. 2005. Proof analysis in modal logic. Journal of Philosophical Logic 34: 507–544.CrossRef Negri, S. 2005. Proof analysis in modal logic. Journal of Philosophical Logic 34: 507–544.CrossRef
[175]
go back to reference Leszczyńska, D. 2008. The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R anf G. Studia Logica 89(3): 365–399.CrossRef Leszczyńska, D. 2008. The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R anf G. Studia Logica 89(3): 365–399.CrossRef
Metadata
Title
Logics of Linear Frames
Author
Dr. Andrzej Indrzejczak
Copyright Year
2010
Publisher
Springer Netherlands
DOI
https://doi.org/10.1007/978-90-481-8785-0_9

Premium Partner