Standard array

From formulasearchengine
Jump to navigation Jump to search

In mathematical logic, the ancestral relation (often shortened to ancestral) of an arbitrary binary relation R is defined below.

The ancestral makes its first appearance in Frege's Begriffsschrift. Frege later employed it in his Grundgesetze as part of his definition of the natural numbers (actually the finite cardinals). Hence the ancestral was a key part of his search for a logicist foundation of arithmetic.

Definition

The numbered propositions below are taken from his Begriffsschrift and recast in contemporary notation.

A property F is called "R-hereditary" if, whenever x is F and xRy holds, then y is also F:

(FxxRy) → Fy.

Frege then defined b to be an R-ancestor of a, written aR*b, if b has every R-hereditary property that all objects x such that aRx have:

76: aR*b ↔ ∀Fxy [((aRxFx) ∧ (FxxRyFy)) → Fb].

The ancestral is transitive:

98: ⊢ (aR*bbR*c) → aR*c.

Let the notation I(R) denote that R is functional (Frege calls such relations "many-one"):

115: I(R) ↔ ∀xyz [(xRyxRz) → y=z],

If R is functional, then the ancestral of R is what nowadays is called connectedTemplate:Clarify:

133: ⊢ (I(R) ∧ aR*baR*c) → (bR*cb=ccR*b).

Discussion

Principia Mathematica made repeated use of the ancestral, as does Quine's (1951) Mathematical Logic.

However, it is worth noting that the ancestral relation cannot be defined in first-order logic, and following the resolution of Russell's paradox both Frege and Quine largely considered the use of second-order logic a questionable approach. In particular, Quine did not consider second-order logic to be "logic" at all, despite his reliance upon it for his 1951 book (which largely retells Principia in abbreviated form, for which second-order logic is required to fit its theorems).

See also

References

External links

ja:概念記法