Skip to main content
SpringerLink
Log in

Propositional calculi of term satisfiability and process logics

  • Conference paper
  • First Online:
Computation Theory (SCT 1984)

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

Included in the following conference series:

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. Chandra A., Halpern I., Mayer A., Parikh R., Equations between regular terms and an application to process logic Annual ACM Symp. on Theory of Computing, 1981, pp.384–390.

    Google Scholar 

  2. Habasiński Z., Process logics: two decidability results, MFCA 1984, Lecture Notes in CS 176, pp.282–290

    Google Scholar 

  3. Harel D., Kozen D., Parikh R., Process Logic: expresiveness, decidability, completeness, J. of Comp. and System. Sci., vol.25, 1982, pp.144–170.

    Google Scholar 

  4. Landweber P., Decision problems of phrase structure grammars, IEEE Trans, Electronic Comput. vol 13, N4, 1964, 354–362.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Polish Acad. of Sci., Mielżyńskiego 27/29, 61-725, Poznań

    R. Knast

Authors
  1. R. Knast
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knast, R. (1985). Propositional calculi of term satisfiability and process logics. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-16066-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39748-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation