Skip to main content
SpringerLink
Log in

Decision procedure for checking validity of PAL formulas

  • Part III Communications
  • Conference paper
  • First Online:
Aspects and Prospects of Theoretical Computer Science (IMYCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 464))

Included in the following conference series:

  • 123 Accesses

Abstract

The aim of propositional algorithmic logic (PAL) is to investigate properties of simple nondeterministic while-program schemes on propositional level. We present algorithm for checking validity of PAL sequents based on a finite Gentzen-type axiomatization, which reaches lower complexity limit. Additionally we obtain small model theorem for PAL.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chlebus, On the Decidability of Propositional Algorithmic Logic, Zeitschr. f. math. Logik 28, 247–261 (1982)

    Google Scholar 

  2. Fisher M. J. and Ladner R. E., Propositional dynamic logic of regular programs, J. Comput. Syst. Sci. 18 194–211.

    Google Scholar 

  3. Harel D., Dynamic Logic, Handbook of Philosophical Logic Vol 11, 197–604 (1984)

    Google Scholar 

  4. Mirkowska G., PAL — propositional algorithmic logic, Fund Informaticae 4, 675–760. Also in Lecture Notes in Computer Science, Vol 125, Springer-Verlag pp.23–101 (1981)

    Google Scholar 

  5. Nishimura H., Sequential Method in Propositional Dynamic Logic, Acta Informatica 12, pp. 377–400 (1979)

    Google Scholar 

  6. Nishimura H., Semantical Analysis of Constructive PDL, Publ. Res. Inst. Math. Sci. Kyoto Univ. (1981)

    Google Scholar 

  7. Salwicki A., Formalized algorithmic languages, Bull. Acad. Polon Sci. Ser Sci. Math. Astron. Phys. 18, pp. 227–232 (1970)

    Google Scholar 

  8. Street R.S., Propositional dynamic logic of looping and converse is elementary decidable, Inf. and Control 54 pp. 121–141. (1982)

    Google Scholar 

  9. Walukiewicz I. Gentzen Type Axiomatization of PAL to appear in Proceedings of MFCS 90, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, 00-901, Warszawa, Poland

    Igor Walukiewicz

Authors
  1. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walukiewicz, I. (1990). Decision procedure for checking validity of PAL formulas. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

  • Online ISBN: 978-3-540-46869-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation