Concept

Jaina seven-valued logic

Jaina seven-valued logic is system of argumentation developed by Jaina philosophers and thinkers in ancient India to support and substantiate their theory of pluralism. This argumentation system has seven distinct semantic predicates which may be thought of as seven different truth values. Traditionally, in the Jaina and other Indian literature dealing with topics in Jain philosophy, this system of argumentation is referred to as Saptabhangivada or Syadvada. The earliest reference to Syadvada occurs is the writings of Bhadrabahu (c. 433–357 BCE). There is mention of Syadvada in the Nyayavatara of Siddhasena Divakara (about 480–550 CE). Samantabhadra (about 600 CE) gave a full exposition of the seven parts of Syadvada or Saptabhanginyaya in his Aptamimamsa. The Syadvadamanjari of Mallisena (1292 CE) is a separate treatise on the same theory. There are, of course, still later works and a large number of modern commentaries. The interpretation of Saptabhangivada as a seven-valued logic was attempted by Harvard University philosophy professor George Bosworth Burch (1902–1973) in a paper published in International Philosophical Quarterly in the year 1964. P. C. Mahalanobis, an Indian applied statistician, has given a probabilistic interpretation of the Saptabhangivada. The Saptabhangivada, the seven predicate theory may be summarized as follows: The seven predicate theory consists in the use of seven claims about sentences, each preceded by "arguably" or "conditionally" (syat), concerning a single object and its particular properties, composed of assertions and denials, either simultaneously or successively, and without contradiction. These seven claims are the following. Arguably, it (that is, some object) exists (syad asty eva). Arguably, it does not exist (syan nasty eva). Arguably, it exists; arguably, it doesn't exist (syad asty eva syan nasty eva). Arguably, it is non-assertible (syad avaktavyam eva). Arguably, it exists; arguably, it is non-assertible (syad asty eva syad avaktavyam eva).

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.