Propositional calculi of term satisfiability and process logics

  • R. Knast
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CH H M P]
    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. [Hab]
    Habasiński Z., Process logics: two decidability results, MFCA 1984, Lecture Notes in CS 176, pp.282–290Google Scholar
  3. [HKP]
    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. [L]
    Landweber P., Decision problems of phrase structure grammars, IEEE Trans, Electronic Comput. vol 13, N4, 1964, 354–362.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • R. Knast
    • 1
  1. 1.Institute of MathematicsPolish Acad. of Sci.Poznań

Personalised recommendations