Pokkuveyil won Aravindan the State Film award for best director. The film stars Balachandran Chullikad, Kalpana, S. Satish Kumar, Kalabhavan Ansar and Chavara V. P. Nair. The film's score was composed by Balachandran Chullikkad. The indefinability of the human mind is the theme of the film.
|
|
Uncertainty and indeterminacy are words for essentially the same concept in both quantum mechanics. Unquantifiability, and undefinability (or indefinability), can also sometimes be synonymous with indeterminacy. In science, indeterminacy can sometimes be interchangeable with unprovability or unpredictability. Also, anything entirely inobservable can be said to be indeterminate in that it cannot be precisely characterized.
|
|
The indefinability of the human mind is the theme of the film. Though the film is discussing a serious issue, the treatment of it is very simplistic. Humour and intensity characterise the film that is set in the mid-fifties. The film is different from many of Aravindan's earlier works in that it deals with a broad range of characters and lacks a clear-cut linear story.
|
|
The title page of Principia Ethica Principia Ethica is a 1903 book by the British philosopher G. E. Moore, in which the author insists on the indefinability of "good" and provides an exposition of the naturalistic fallacy. Principia Ethica was influential, and Moore's arguments were long regarded as path-breaking advances in moral philosophy, though they have been seen as less impressive and durable than his contributions in other fields.
|
|
As a philosopher, Jeffrey specialized in epistemology and decision theory. He is perhaps best known for defending and developing the Bayesian approach to probability. Jeffrey also wrote, or co-wrote, two widely used and influential logic textbooks: Formal Logic: Its Scope and Limits, a basic introduction to logic, and Computability and Logic, a more advanced text dealing with, among other things, the famous negative results of twentieth century logic such as Gödel's incompleteness theorems and Tarski's indefinability theorem.
|
|
Similarly, Tarski's indefinability theorem can be interpreted both in terms of definability and in terms of computability. Recursion theory is also linked to second order arithmetic, a formal theory of natural numbers and sets of natural numbers. The fact that certain sets are computable or relatively computable often implies that these sets can be defined in weak subsystems of second order arithmetic. The program of reverse mathematics uses these subsystems to measure the noncomputability inherent in well known mathematical theorems.
|
|
Of his body of work, Johanna Burton writes, "Dunham's career can be characterized by its rigorous indefinability, as his works dip freely into the realms of abstraction, figuration, surrealism, graffiti, pop, even cartoons, without ever settling loyally into any one of them." Johanna Burton, Exhibition: "Carroll Dunham Paintings", The New Museum. David Pagel, in a Los Angeles Times review intended to be complimentary, described his paintings as "vulgar beyond belief..."David Pagel, Art review: Carroll Dunham at Blum & Poe, Los Angeles Times, April 30, 2010.
|
|
Kummatty is a Pied Piper-like figment of Malabar's folklore about a partly mythic and partly real magician called Kummatty (bogeyman) while Esthappan blends together the Biblical story of the deeds of Christ and the way society responded to him, with the life of Esthappan, whose life mystified others. Indefinability of the human mind was the theme of his next film Pokkuveyil (1981). The music for this film was composed by flautist Hariprasad Chaurasia. The legend is that visuals of this film were composed according to musical notations, without any script.
|
|
Moore's argument for the indefinability of 'good' (and thus for the fallaciousness in the "naturalistic fallacy") is often called the open-question argument; it is presented in §13 of Principia Ethica. The argument hinges on the nature of statements such as "Anything that is pleasant is also good" and the possibility of asking questions such as "Is it good that x is pleasant?". According to Moore, these questions are open and these statements are significant; and they will remain so no matter what is substituted for "pleasure". Moore concludes from this that any analysis of value is bound to fail.
|
|
After discussing James, Peirce stated (Section V, fourth paragraph) as the specific occasion of his coinage "pragmaticism", journalist, pragmatist, and literary author Giovanni Papini's declaration of pragmatism's indefinability (see for example "What Is Pragmatism Like", a translation published in October 1907 in Popular Science Monthly v. 71, pp. 351–358, Google Books Eprint). Peirce in his closing paragraph wrote that "willing not to exert the will (willing to believe)" should not be confused with "active willing (willing to control thought, to doubt, and to weigh reasons)", and discussed his dismay by that which he called the other pragmatists' "angry hatred of strict logic".
|
|
This is related to Tarski's indefinability theorem. The example of ZFC illustrates the importance of distinguishing the metamathematics of a formal system from the statements of the formal system itself. The property D(φ) that a formula φ of ZFC defines a unique real number is not itself expressible by ZFC, but must be considered as part of the metatheory used to formalize ZFC. From this viewpoint, Richard's paradox results from treating a construction of the metatheory (the enumeration of all statements in the original system that define real numbers) as if that construction could be performed in the original system.
|
|
This leads to a contradiction in naive set theory. This paradox is avoided in axiomatic set theory. Although it is possible to represent a proposition about a set as a set, by a system of codes known as Gödel numbers, there is no formula \phi(a,x) in the language of set theory which holds exactly when a is a code for a finite description of a set and this description is a true description of the set x. This result is known as Tarski's indefinability theorem; it applies to a wide class of formal systems including all commonly studied axiomatizations of set theory.
|
|