Information about Hypostatic Abstraction

Hypostatic abstraction, also known as hypostasis or subjectal abstraction, is a formal operation that takes an element of information, such as might be expressed in a proposition of the form X is Y, and conceives its information to consist in the relation between a subject and another subject, such as expressed in a proposition of the form X has Y-ness. The existence of the latter subject, here Y-ness, consists solely in the truth of those propositions that have the corresponding concrete term, here Y, as the predicate. The object of discussion or thought thus introduced may also be called a hypostatic object.

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

The way that Charles 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

See also

External links

ierce]].

Western Philosophy
19th/20th century philosophy

Name: Charles Sanders Peirce
Birth: September 10, 1839
Cambridge, Massachusetts
Death: April 19, 1914
Milford, Pennsylvania
..... Click the link for more information.
In logic, mathematics, and computer science, the arity (synonyms include type, adicity, and rank) of a function or operation is the number of arguments or operands that the function takes.
..... Click the link for more information.
ierce]].

Western Philosophy
19th/20th century philosophy

Name: Charles Sanders Peirce
Birth: September 10, 1839
Cambridge, Massachusetts
Death: April 19, 1914
Milford, Pennsylvania
..... Click the link for more information.
Charles Hartshorne (June 5, 1897 – October 9, 2000) was a prominent American philosopher who concentrated primarily on the philosophy of religion and metaphysics. He developed the neoclassical idea of God and produced a modal proof of the existence of God that was a
..... Click the link for more information.
Arthur Walter Burks (born October 131915 in Duluth, Minnesota) is an American mathematician who in the 1940s as a senior engineer on the project contributed to the design of the ENIAC, the first general-purpose electronic digital computer.
..... Click the link for more information.
Abstraction is the process of generalization by reducing the information content of a concept or an observable phenomenon, typically in order to retain only information which is relevant for a particular purpose.
..... Click the link for more information.
In computer science, abstraction is a mechanism and practice to reduce and factor out details so that one can focus on a few concepts at a time.

The following English definition of abstraction helps to understand how this term applies to Computer Science, IT and Objects - i.
..... Click the link for more information.
Abstraction in mathematics is the process of extracting the underlying essence of a mathematical concept, removing any dependence on real world objects with which it might originally have been connected, and generalising it so that it has wider applications.
..... Click the link for more information.
Analogy is both the cognitive process of transferring information from a particular subject (the analogue or source) to another particular subject (the target), and a linguistic expression corresponding to such a process.
..... Click the link for more information.
In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them. Categories now appear in most branches of mathematics and in some areas of theoretical computer science and mathematical physics, and have been a unifying notion.
..... Click the link for more information.
Continuous predicate is a term coined by Charles Sanders Peirce (1839–1914) to describe a special type of relational predicate that results as the limit of a recursive process of hypostatic abstraction.
..... Click the link for more information.
Hypostatic abstraction, also known as hypostasis or subjectal abstraction, is a formal operation that takes an element of information, such as might be expressed in a proposition of the form X is Y
..... Click the link for more information.
Prescisive abstraction or prescision, variously spelled as precisive abstraction or prescission, is a formal operation that marks, selects, or singles out one feature of a concrete experience to the disregard of others.
..... Click the link for more information.
Reification may refer to:
  • Reification (computer science), making a data model for a previously abstract concept.
  • Reification (fallacy), fallacy of treating an abstraction as if it were a real thing.

..... Click the link for more information.
E-Prime uses a modified English syntax and vocabulary lacking all forms of the verb to be: be, is, am, are, was, were, been and being, as well as their contractions, such as it's and I'm.
..... Click the link for more information.


This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus


page counter