Reification: Difference between revisions
m →Alternative uses: - added computer science link |
No edit summary |
||
Line 10: | Line 10: | ||
:* "One has the right to own slaves". |
:* "One has the right to own slaves". |
||
:* "Their ideology is going to ruin this country". |
:* "Their ideology is going to ruin this country". |
||
:* "Give me a big container of justice!" |
|||
==Alternative uses== |
==Alternative uses== |
||
Line 24: | Line 25: | ||
==See also== |
==See also== |
||
* [[Georg Lukacs|Georg Lukács]] |
* [[Georg Lukacs|Georg Lukács]] |
||
* [[Hypostatic abstraction]] |
* [[Hypostatic abstraction]] |
Revision as of 22:42, 21 February 2006
Reification, also called hypostatization, is treating a concept, an abstraction, as if it were a real, concrete thing. The term is often used pejoratively by epistemological realists as a criticism of epistemological idealists. Epistemological realists often regard reification as a logical fallacy.
Fallacious arguments based on reification may be committed when manipulations that are only possible on concrete things are said to be performable on an abstract concept. A fallacy is also said to be committed when an abstract concept is referred to as if it bore no relation to the concrete things of which it is an abstraction. Examples of fallacious statements arising from reification are:
- "That country doesn't have any democracy. We should give some of ours to them".
- "Give peace a chance".
- "This is knowledge".
- "War leads to peace".
- "One has the right to life, liberty, and the pursuit of happiness".
- "One has the right to own slaves".
- "Their ideology is going to ruin this country".
- "Give me a big container of justice!"
Alternative uses
- In knowledge representation, reification is sometimes used to represent facts that must then be manipulated in some way, for example to compare logical assertions from different witnesses to determine their credibility. The message "John is six feet tall" is an assertion of truth that commits the sender to the fact, whereas the reified statement, "Mary reports that John is six feet tall" defers this commitment to Mary. In this way, the statements can be incompatible without creating contradictions in reasoning. For example the statements "John is six feet tall" and "John is five feet tall" are incompatible with each other; the statements "Mary reports that John is six feet tall" and "Paul reports that John is five feet tall" are not incompatible with each other, since they are both compatible with the assumption that at least one of them doesn't say the truth about Paul or Mary's report, or that Mary or Paul is mistaken or lying.
- Reification is a term used in computer science and artificial intelligence to describe the act of making a data model for a previously abstract concept. Reification allows a computer to process an abstraction as if it were any other data. See also refinement and Ontology (computer science).
- In Marxism, the consideration of a human being as a physical object, deprived of subjectivity.
- In natural language processing, reification can refer to where a natural language statement is transformed so actions and events in it become quantifiable variables. For example "John chased the duck furiously" can be transformed into something like "(Exists e)(chasing(e) & past_tense(e) & actor(e,John) & furiously(e) & patient(e,duck))". Another example would be "Sally said John is mean", which could be expressed as something like "(Exists u,v)(saying(u) & past_tense(u) & actor(u,Sally) & that(u,v) & is(v) & actor(v,John) & mean(v))".
This is so that statements which seemingly cannot be expressed in classical first-order predicate calculus, due to their use of tense, modality, adverbial constructions, propositional arguments (e.g. "Sally said that X"), etc., can in fact be manipulated using only the tools of classical first-order predicate calculus. This is an advantage because predicate calculus is better understood and simpler than the more complex alternatives (higher-order logics, modal logics, temporal logics, etc.), and there exist better automated tools (e.g. automated theorem provers and model checkers) for manipulating it.