Algorithmic properties of structure : Selected papers of Erwin Engeler

The volume begins with the area of enrichment of classical model theory by languages which express properties representing the outcome of hypothetical computer programs executed in a given class of mathematical structures, and is related to questions of correctness and provability of programs. This point of view allowed the generalization of classical Galois theory to the point of discussing the relation between structure and complexity of solution programs for problems posed in various mathematical theories. The algebraic approach is deepened and enlarged in the later papers by showing that the algorithmic aspects of any mathematical structure can be uniformly dealt with by expanding these structures into combinatory algebras. --from publisher description
Call no. : 511.8 E574
Bạn đang xem trang mẫu tài liệu này.