AbstractIn this paper, the study of the expressive power of certain classes of program schemes on finite structures is continued, in relation to more mainstream logics studied in finite model theory and to computational complexity. The author shows that there exists a program scheme – whose constructs are assignments and while-loops with quantifier-free tests and which has access to a stack – that can accept a P-complete problem, the deterministic path system problem, even in the absence of non-determinism, so long as problem instances are presented in a functional style. (The proof given here leans heavily on Cook's proof that the classes of formal languages accepted by deterministic and non-deterministic logspace auxiliary pushdown machines coincide.) However, whilst this result is of independent interest, in that it leads to a deterministic model of computation capturing P, whose non-deterministic variant also captures P, the program scheme can also be used to build a successor relation in certain classes of structures (namely: the class of strongly connected locally ordered digraphs, the class of connected planar embeddings, and the class of triangulations), with the consequence that on these classes of graphs, (a fragment of) path system logic (with no built-in relations) captures exactly the polynomial-time solvable problems.
Flexibility of projective-planar embeddings
