Natural Formalization proposes a concrete way of expanding proof theory from the meta-mathematical investigation of formal theories to an examination of “the concept of the specifically mathematical proof.” Formal proofs play a role for this examination in as much as they reflect the essential structure and systematic construction of mathematical proofs. We emphasize three crucial features of our formal inference mechanism: (1) the underlying logical calculus is built for reasoning with gaps and for providing strategic directions, (2) the mathematical frame (...) is a definitional extension of Zermelo–Fraenkel set theory and has a hierarchically organized structure of concepts and operations, and (3) the construction of formal proofs is deeply connected to the frame through rules for definitions and lemmas. To bring these general ideas to life, we examine, as a case study, proofs of the Cantor–Bernstein Theorem that do not appeal to the principle of choice. A thorough analysis of the multitude of “different” informal proofs seems to reduce them to exactly one. The natural formalization confirms that there is one proof, but that it comes in two variants due to Dedekind and Zermelo, respectively. In this way it enhances the conceptual understanding of the represented informal proofs. The formal, computational work is carried out with the proof search system AProS that serves as a proof assistant and implements the above inference mechanism; it can be fully inspected at (see link below). (shrink)

Geach's account of the Aristotelian logic of categorical sentences supplemented the views shared by Frege, Russell, Quine and others. I argue that this particular predicate logic approach and Geach's points apply to only one variety of natural language categorical sentences. For example, it takes the universal categorical as a universal conditional “If anything is a man, then it is mortal”. A different natural language form can and should be invoked: “Every man is a mortal.” Employing special restricted quantifiers in a (...) version of predicate logic, we justify a full square of opposition and the rules of quality and quantity that Geach rejected. (shrink)