Precursors Of Category Theory • 6

Hilbert and Ackermann • Principles of Mathematical Logic (1928)

For the intuitive interpretation on which we have hitherto based the predicate calculus, it was essential that the sentences and predicates should be sharply differentiated from the individuals, which occur as the argument values of the predicates.  Now, however, there is nothing to prevent us from considering the predicates and sentences themselves as individuals which may serve as arguments of predicates.

Consider, for example, a logical expression of the form (x)(A \rightarrow F(x)).  This may be interpreted as a predicate P(A, F) whose first argument place is occupied by a sentence A, and whose second argument place is occupied by a monadic predicate F.

A false sentence A is related to every F by the relation P(A, F);   a true sentence A only to those F for which (x)F(x) holds.

Further examples are given by the properties of reflexivity, symmetry, and transitivity of dyadic predicates.  To these correspond three predicates:  \mathrm{Ref}(R), \mathrm{Sym}(R), and \mathrm{Tr}(R), whose argument R is a dyadic predicate.  These three properties are expressed in symbols as follows:

\begin{array}{l}  \mathrm{Ref}(R) \colon (x)R(x, x),  \\[6pt]  \mathrm{Sym}(R) \colon (x)(y)(R(x, y) \rightarrow R(y, x)),  \\[6pt]  \mathrm{Tr}(R) \colon (x)(y)(z)(R(x, y) \And R(y, z) \rightarrow R(x, z)).  \end{array}

All three properties are possessed by the predicate \equiv(x, y)   (x is identical with y).  The predicate <(x, y), on the other hand, possesses only the property of transitivity.  Thus the formulas \mathrm{Ref}(\equiv), \mathrm{Sym}(\equiv), \mathrm{Tr}(\equiv), and \mathrm{Tr}(<) are true sentences, whereas \mathrm{Ref}(<) and \mathrm{Sym}(<) are false.

Such predicates of predicates will be called predicates of second level.  (p. 135).

We have, first, predicates of individuals, and these are classified into predicates of different categories, or types, according to the number of their argument places.  Such predicates are called predicates of first level.

By a predicate of second level, we understand one whose argument places are occupied by names of individuals or by predicates of first level, where a predicate of first level must occur at least once as an argument.  The categories, or types, of predicates second level are differentiated according to the number and kind of their argument places.  (p. 152).

Reference

  • Hilbert, D. and Ackermann, W., Principles of Mathematical Logic, Robert E. Luce (trans.), Chelsea Publishing Company, New York, NY, 1950.  1st published, Grundzüge der Theoretischen Logik, 1928.  2nd edition, 1938.  English translation with revisions, corrections, and added notes by Robert E. Luce, 1950.

Resources

cc: FB | Peirce MattersLaws of FormMathstodonOntologAcademia.edu
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

This entry was posted in Abstraction, Ackermann, Aristotle, C.S. Peirce, Carnap, Category Theory, Hilbert, Kant, Logic, Logic of Relatives, Mathematics, Peirce, Peirce's Categories, Relation Theory, Saunders Mac Lane, Sign Relations, Type Theory and tagged , , , , , , , , , , , , , , , , . Bookmark the permalink.

1 Response to Precursors Of Category Theory • 6

  1. Pingback: Survey of Precursors Of Category Theory • 5 | Inquiry Into Inquiry

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.