12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Thursday November 07, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Peirce's 1870 Logic Of Relatives (view source)
Revision as of 17:58, 27 November 2007
, 17:58, 27 November 2007→Commentary Note 11.8: markup
| |''L''<sub>''x''.''j''</sub>| = ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
| |''L''<sub>''x''.''j''</sub>| = ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
|-
|-
| ''L'' is (<''c'')-regular at ''j
| ''L'' is (<''c'')-regular at ''j''
| iff
| iff
| |''L''<sub>''x''.''j''</sub>| < ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
| |''L''<sub>''x''.''j''</sub>| < ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
|-
|-
| L is (>c)-regular at j
| L is (>''c'')-regular at ''j''
| iff
| iff
| |''L''<sub>''x''.''j''</sub>| > ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
| |''L''<sub>''x''.''j''</sub>| > ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
|-
|-
| L is (=<c)-regular at j
| L is (≤''c'')-regular at ''j''
| iff
| iff
| |''L''<sub>''x''.''j''</sub>| ≤ ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
| |''L''<sub>''x''.''j''</sub>| ≤ ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
|-
|-
| L is (>=c)-regular at j
| L is (≥''c'')-regular at ''j''
| iff
| iff
| |''L''<sub>''x''.''j''</sub>| ≥ ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
| |''L''<sub>''x''.''j''</sub>| ≥ ''c'' for all ''x'' in ''X''<sub>''j''</sub>.
Clearly, if any relation is (≤''c'')-regular on one of its domains ''X''<sub>''j''</sub> and also (≥''c'')-regular on the same domain, then it must be (=''c'')-regular on the affected domain ''X''<sub>''j''</sub>, in effect, ''c''-regular at ''j''.
Clearly, if any relation is (≤''c'')-regular on one of its domains ''X''<sub>''j''</sub> and also (≥''c'')-regular on the same domain, then it must be (=''c'')-regular on the affected domain ''X''<sub>''j''</sub>, in effect, ''c''-regular at ''j''.
For example, let ''G'' = {''r'', ''s'', ''t'} and ''H'' = {1, …, 9}, and consider the 2-adic relation ''F'' ⊆ ''G'' × ''H'' that is bigraphed here:
For example, let ''G'' = {''r'', ''s'', ''t''} and ''H'' = {1, …, 9}, and consider the 2-adic relation ''F'' ⊆ ''G'' × ''H'' that is bigraphed here:
<pre>
<pre>
