In B, under the influence of heat, sulfur reacts with carbon atoms close to the double bonds, and an indeterminate number of sulfur atoms (Sn) form linkages between adjacent chains.
SPN follows from the strong neutrality (SN) condition of Section 4.5, on identifying $\langle R_{i}\rangle$ with $\langle R_{i}^*\rangle$.
We say that s ∈ t when sn ∈ tn+1 for all n.
(Sn 4.12) In the Yuktiṣaṣṭikāvṛtti (35), Candrakırti similarly raises the same question: "When the victorious (jīnas) have stated that nirvāṇa alone is true, what learned person will then imagine that the rest is not false?
This means (assuming that RESULT is a function) that G will be satisfied by the situation sn, where s0 = s and si+1 is the s′ such that RESULT ai+1,si,s′).
The objects of our first model of positive set theory are sequences sn with each sn a type n set and with sn+1 refining sn for each n.
Given an initial 'seed' numeral s1, s2, …, sn, the algorithm simply spits out the digits in order.
The memory is the 'warehouse' where all the sensible species are stored, so that the cogitative soul can perform its tasks even without the presence of any sensible object (SN, part V, chap. 30, fol. 84ra va).
The way S performs its function (when it performs it) is by occupying different states s1, s2, … sn corresponding to the different determinate values f1, f2 … fn, of F".
It is straightforward to establish that if sn ∈ tn+1 or sn = tn is false, then sk ∈ tk+1 or (respectively) sk = tk is false for all k > n.
Finally, for any class of sequences (elements of the intended model) C, there is a smallest set which contains all elements of C: let cn+1 be the set of terms sn of sequences s belonging to C at each type n to construct a sequence c which will have the desired property.
