Famous for the number-theoretic first-order statement known as Goodstein's theorem, author R. L. Goodstein was also well known as a distinguished educator. With this text, he offers an elementary treatment that employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. The text begins with an informal introduction to the algebra of classes, exploring union, intersection, and complementation; the commutative, associative, and distributive laws; difference and symmetric difference; and Venn diagrams. Professor Goodstein proceeds (...) to a detailed examination of three different axiomatizations, and an outline of a fourth system of axioms appears in the examples. The final chapter, on lattices, examines Boolean algebra in the setting of the theory of partial order. Numerous examples appear at the end of each chapter, with full solutions at the end. (shrink)

The proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could be found only by transcending the axioms (...) and proof processes of that formal system. Gentzen's proof succeeds by utilisingtransfinite inductionto prove that certain sequences of reduction processes, enumerated by ordinals less than ε (the first ordinal to satisfy ε = ὡ) are finite. Were it possible to provethe restricted ordinal theorem, that a descending sequence of ordinals, less thanε, is finite, in Gentzen's “reine Zahlentheorie,” then it would be possible to determine a contradiction in that number system. In his paper, Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument. There is also a method of reducing transfinite induction, for ordinals less than ε, to a number-theoretic principle given by Hilbert and Bernays, and a similar method by Ackermann. None of these proofs of transfinite induction isfinitist. (shrink)

This graduate-level_text by a master in the field builds a function theory of the rational field that combines aspects of classical and intuitionist analysis. Topics include recursive convergence, recursive and relative continuity, recursive and relative differentiability, the relative integral, elementary functions, and transfinite ordinals. 1961 edition.

The crux of the dispute between formalism and intuitionism, it is held, is not whether certain entities exist or not, but how the term function shall be used in mathematics. The identification of effective definition with general recursion fails because an undefined function lies concealed beneath the requirement of a finite number of substitutions, and a fresh characterization of effective definition is sought in terms of a hierarchy of ordinal recursions.A correspondence exists between primitive recursive properties and direct proofs, of (...) irrationality and transcendence for instance, and between general recursive properties and indirect proofs.Mathematics is a concept creating activity and the distinction between a formal mathematics devoid of meaning, at one level, and a meaningful metamathematics at the next is considered to be untenable.RésuméLa controverse entre les formalistes et les intuitionistes ne repose pas, considére‐t‐on, sur l'existence ou la non‐existence de certaines entités, mail sur l'usage du terme fonction en mathématiques. L'identification de la définition effective avec la récursion générate n'est pas valable parce qu'une fonction indéfinié est dissimulée sous la nécessité d'un nombre fini de substitutions, et une nouvelle caractérisation de définition effective est recherchée sous forme de hiérarchie de récursions ordinates.II existe, d'une part, une correspondance entre les propriétés primitives récursives et les preuves directes, d'irrationalité et de transcendance par exemple, et, d'autre part, entre les propriétés récursives générates et les preuves par l'absurde.Les mathématiques sont une activité créatrice de concepts, et la distinction entre les mathématiques formelles dépourvues de sens et, sur le plan supérieur, une méta‐mathématique chargée de sens, ne semble pas justifiée. (shrink)