Publisher's Synopsis
Excerpt from Translatability and Decidability Questions for Restricted Classes of Program Schemas
A schema is �222 if every finite path through its flow diagram from the start statement is an initial segment of some execution sequence. This property has been shown [7] to be equivalent to the restriction that under no Herbrand interpretation is any predicate symbol of rank n ever applied to an n-tuple of elements of the universe more than once.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
