Premium
Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with them
Author(s) -
Wasilewska Anita
Publication year - 1985
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19850311902
Subject(s) - context (archaeology) , automated theorem proving , computer science , algebraic number , algebra over a field , center (category theory) , mathematics , algorithm , discrete mathematics , pure mathematics , mathematical analysis , paleontology , chemistry , biology , crystallography
Tlie notion of PI>and FC-algorithms has been defined by A.MAZURKIEWICZ [Z] in order to describe some properties of Algol-like programs. These algorithms can be regarded as adequate mathemat.ica1 models for large class of programs including iterative programs. recursive procedures and even some more general cases. So called finite control algorithms (FChlgorithms) are regarded as adequate models for iterative programs and push-down algorithms (PD-algorithms) are regarded as adequate models for recursive procedures. The properties of PC-algorithms and PD-algorithms are closely connected with the propert,ies of regular and context-free languages