# Hypostatic abstraction

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Hypostatic abstraction is a formal operation that takes an element of information, as expressed in a proposition $$X ~\text{is}~ Y,\!$$ and conceives its information to consist in the relation between that subject and another subject, as expressed in the proposition $$X ~\text{has}~ Y\!\text{-ness}.\!$$  The existence of the abstract subject $$Y\!\text{-ness}\!$$ consists solely in the truth of those propositions that contain the concrete predicate $$Y.\!$$  Hypostatic abstraction is known by many names, for example, hypostasis, objectification, reification, and subjectal abstraction.  The object of discussion or thought thus introduced is termed a hypostatic object.

The above definition is adapted from the one given by introduced Charles Sanders Peirce (CP 4.235, “The Simplest Mathematics” (1902), in Collected Papers, CP 4.227–323).

The way that Peirce describes it, the main thing about the formal operation of hypostatic abstraction, insofar as it can be observed to operate on formal linguistic expressions, is that it converts an adjective or some part of a predicate into an extra subject, upping the arity, also called the adicity, of the main predicate in the process.

For example, a typical case of hypostatic abstraction occurs in the transformation from “honey is sweet” to “honey possesses sweetness”, which transformation can be viewed in the following variety of ways:

The grammatical trace of this hypostatic transformation tells of a process that abstracts the adjective “sweet” from the main predicate “is sweet”, thus arriving at a new, increased-arity predicate “possesses”, and as a by-product of the reaction, as it were, precipitating out the substantive “sweetness” as a new second subject of the new predicate, “possesses”.

## References

• Peirce, C.S., Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958.

## Syllabus

### Logical operators

Template:Col-breakTemplate:Col-breakTemplate:Col-end

### Related topics

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

### Relational concepts

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

### Information, Inquiry

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

### Related articles

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

## Document history

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.