The Commens Dictionary

Quote from ‘On Logical Graphs’

Term: 
Rhema
Quote: 

An assertion fulfilling the condition having been obtained, let a number of the proper designations of individual subjects be omitted, so that the assertion becomes a mere blank form for an assertion which can be reconverted into an assertion by filling all the blanks with proper names. I term such a blank form a rheme. If the number of blanks it contains is zero, it may nevertheless be regarded as a rheme, and under this aspect, I term it a medad. A medad is, therefore, merely an assertion regarded in a certain way, namely as subject to the inquiry, How many blanks has it? If the number of blanks is one, I term the rheme a monad. If the number of blanks exceeds one, I term it a Relative Rheme. If the number of blanks is two, I term the rheme a Dyad, or Dyadic Relative. If the number of blanks exceeds two, I term it a Polyad, or Plural Relative, etc.

Source: 
Peirce, Charles S. (1903 [c.]). On Logical Graphs. MS [R] 479
Date: 
1903 [c.]
References: 
CP 4.354
Citation: 
‘Rhema’ (pub. 18.08.13-19:54). Quote in M. Bergman & S. Paavola (Eds.), The Commens Dictionary: Peirce's Terms in His Own Words. New Edition. Retrieved from http://www.commens.org/dictionary/entry/quote-logical-graphs.
Posted: 
Aug 18, 2013, 19:54 by Sami Paavola
Last revised: 
Jan 02, 2016, 15:49 by Mats Bergman