# 28

### Facsimile

### Transcription

22

If we take any proposition, say

A sinner kills a saint

and if we erase portions of it, so as to leave

it a __blank form__ of proposition, the __blanks__

being such that if ~~they are all~~ every one of them is filled with a

proper name, a proposition will result,

such as

______ kills a saint

A sinner kills ______

______ kills ______

where __Cain__ and __Abel__ might for example

fill the blanks, than such a blank form,

as well as the complete proposition, is called

a __rheme__ provided it be neither logical necessity true of everything nor true of nothing, but this limitation may be disregarded. If it has one blank it is called

a __monad__ rheme, if two a __dyad__, if three

a __triad__, if none a __medad__ (from μηδέν).

Now such a __rheme__ being neither logically necessary nor logically impossible, and representive

as a [part of ?] a graph without being

represented ~~as compounded~~ as a combination by any of the

signs of the system is called a __lexis__

and each replica of the lexis is called a __spot__. Such

[A __lexis__ is therefore an incomplex __contingent__ graph. ?]

## Page Notes

Please sign in to write a note for this page