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. A concept is an abstract, universal idea, notion, or entity that serves to designate a category or class of entities, events, or relations. ... // An abstraction is an idea, concept, or word which defines the phenomena which make up the concrete events or things which the abstraction refers to, the referents. ... Epistomological realism is a philosophical position, a subcategory of objectivism, holding that what you know about an object exists independently of your mind. ... Epistemological idealism is a philosophical position, a subcategory of subjectivism, holding that what you know about an object exists only in your mind. ... A logical fallacy may mean nothing more than a fallacy or it may mean an error in deductive reasoning, i. ...

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: Placing a concrete floor for a commercial building Installing rebar in a floor during a concrete pour In construction, concrete is a composite building material made from the combination of aggregate and cement binder. ... This article is about the concept of abstraction in general. ...

• "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 persuit of property".
• "One has the right to own slaves".
• "Their ideology is going to ruin this country".

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. Knowledge representation is needed for library classification and for processing concepts in an information system. ... The logical assertion is a statement that asserts that a certain premise is true, and is useful for statements in proof. ... This article is about witnesses in law courts. ... Credibility is the believability of a statement, action, or source, and the ability of the observer to believe that statement. ... Reasoning is the act of using reason to derive a conclusion from certain premises. ... Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: | ... Artificial intelligence (AI) is defined as intelligence exhibited by an artificial entity. ... A data model is a model that describes in an abstract way how data is represented in a business organization, an information system or a database management system. ... The word selectivity has more meanings: Selectivity, the ability to notice/distinguish small diferences. ... It has been suggested that Upper Ontology (computer science) be merged into this article or section. ... Marxism is the social theory and political practice based on the works of Karl Marx, a 19th century German philosopher, economist, journalist, and revolutionary, along with Friedrich Engels. ... Natural language processing (NLP) is a subfield of artificial intelligence and linguistics. ... Automated theorem proving (currently the most important subfield of automated reasoning) is the proving of mathematical theorems by a computer program. ... Model checking is a method to algorithmically verify formal systems. ...

See also

• Georg Lukács
• pathetic fallacy