Skip to main content
SpringerLink
Log in

Infinitary propositional normal modal logic

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

A logic with normal modal operators and countable infinite conjunctions and disjunctions is introduced. A Hilbert's style axiomatization is proved complete for this logic, as well as for countable sublogics and subtheories. It is also shown that the logic has the interpolation property.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • G. Gargov, S. Passy, and T. Tinchev, A modal enviroment for Boolean speculations, Proceedings of the Summer School on Mathematical Logic and Applications, Plenum press, (1987, in print).

  • R. Goldblatt, Axiomatising the Logic of Computer Programming, LNCS, 1982, vol 130.

  • D. Gabbay, Investigations in Modal Logics with Applications to Problems in Philosophy and Linguistics, D. Reidel, 1976.

  • D. Harel, First-Order Dynamic Logic, Springer-Verlag, 1979.

  • C. Kalicki, Infinitary propositional intuitionistis logic, Notre Dame Journal of Formal Logic, vol. XXI, No 2 (1980), pp. 216–228.

    Article  Google Scholar 

  • J. Keisler, Model Theory for Infinitary Logic, North-Holland, 1971.

  • S. Kripke, Semantical analysis of modal logic I: Normal modal propositional calculi, Zeitschrift für Mathematische Logic und Grundlagen der Mathematik, vol. 9 (1963), pp 67–96.

    Article  Google Scholar 

  • L. Maximowa, Interpolation theorems in modal logics and amalgamation varieties in topological Boolean algebras, Algebra and Logika 18, No 5 (1979), pp. 556–586 (in Russian).

    Google Scholar 

  • S. Passy, Dynamic Logic With Constants. Ph. D. Thesis, Sofia, 1984.

  • S. Passy and T. Tinchev, PDL with data constants, Inf. Proc. Letters, 20 (1985), pp. 35–41.

    Google Scholar 

  • S. Passy and T. Tinchev, Combinatory Dynamic Logic, Inf. and Control (to appear).

  • S. Radev, Infinitary Propositional Modal Logic and Programming Languages. Ph. D. Thesis, Warszawa, 1981.

  • S. Radev, Propositional logics of formal languages, Fundamenta Informaticae, vol. VII No 4 (1984) pp. 447–482.

    Google Scholar 

  • S. RadevExtensions of PDL and Consequence Relations, LNCS 208, 1985.

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Mechanics, 1126, Sofia, Bulgaria

    Slavian Radev

Authors
  1. Slavian Radev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Radev, S. Infinitary propositional normal modal logic. Stud Logica 46, 291–309 (1987). https://doi.org/10.1007/BF00370641

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370641

Keywords

Search

Navigation