A computer implementation of Gödel’s algorithm for class formation in MathematicaTM was used to formulate definitions and theorems about iteration in Gödel’s class theory. The intent is to use this approach for automated reasoning about a variety of applications of iteration using McCune’s automated reasoning program Otter. The applications include the theory of transitive closures of relations, the arithmetic of natural numbers, construction of invariant subsets, and the Schröder-Bernstein theorem.
CITATION STYLE
Belinfante, J. G. F. (2003). Reasoning about iteration in gödel’s class theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 228–242). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_18
Mendeley helps you to discover research relevant for your work.