Ein Vollständigkeitssatz für Programme und Schaltkreise

SummaryFormal transformations of programs or switching circuits can be described by a system of relations within the concept of free X-categories. In this theory the programs or switching circuits are the morphisms of the free X-category. A finite relation system is given which is correct and complete (in an analogous sense to the notions of the predicate calculus) and which describes the transformations of programs or switching circuits. At first this system can be applied only to loopfree switching circuits or programs, but loops may easily be presented in a free X-category. All these subjects will thoroughly be discussed in this paper.