Universal Constructions for Identity and Number
Abstract
The scheme that Gentzen designed to specify the definitions of logical connectives has a wider reach than is usually recognized, extending naturally to terms that Gentzen did not treat explicitly, including predicate symbols. After explaining (§2) how the introduction and elimination rules of natural deduction calculi provide a relational definition of a term through a universal construction, we will describe how to provide similar constructions of, first, the binary predicate symbol for identity (§3) and, second, the monadic predicate symbol for being a natural number (§4). The main result of §3 is the interderivability of the introduction rule for identity (=I) with the law of reflexivity. This result greatly simplifies the analysis of the former rule. Further, it explains why attempts either to reject =I as unsound or to justify it only relative to specific background assumptions have systematically missed its decontextualized role in inference. In §4 we review the realization, observed by Martin-Löf and Parsons, of the principle of mathematical induction as an elimination rule (\(\mathbb{N}\)E) for the natural number predicate. Noting the universal construction underlying this realization clarifies the relationship between the induction principle and the number concept, at least when the latter is relationally specified, by resituating induction as an integral part of the very definition of the natural numbers. The common motif tying these and other results together is the fact that a term’s introduction and elimination rules are a presentation of a single concept, the term’s universal construction.