12,080
edits
Changes
Directory:Jon Awbrey/Essays/Prospects For Inquiry Driven Systems (view source)
Revision as of 19:22, 17 January 2008
, 19:22, 17 January 2008→3.1.1.1. Blank and Bound Connectives: format display as table
| ''e''<sub>1</sub> ''e''<sub>2</sub> ''e''<sub>3</sub>
| ''e''<sub>1</sub> ''e''<sub>2</sub> ''e''<sub>3</sub>
| means
| means
| ''e''<sub>1</sub> and ''e''<sub>2</sub> and ''e''<sub>3</sub>.
| ''e''<sub>1</sub> and ''e''<sub>2</sub> and ''e''<sub>3</sub> .
|}
|}
| (''e''<sub>1</sub>)
| (''e''<sub>1</sub>)
| means
| means
| not ''e''<sub>1</sub>.
| not ''e''<sub>1</sub> .
|
|
|-
|-
| (''e''<sub>1</sub>, ''e''<sub>2</sub>)
| (''e''<sub>1</sub> , ''e''<sub>2</sub>)
| means
| means
| ''e''<sub>1</sub> xor ''e''<sub>2</sub>,
| ''e''<sub>1</sub> xor ''e''<sub>2</sub> ,
| ''e''<sub>1</sub> + ''e''<sub>2</sub>,
| ''e''<sub>1</sub> + ''e''<sub>2</sub> ,
|-
|-
|
|
| or
| or
| ''e''<sub>1</sub> neq ''e''<sub>2</sub>,
| ''e''<sub>1</sub> neq ''e''<sub>2</sub> ,
| ''e''<sub>1</sub> ≠ ''e''<sub>2</sub>.
| ''e''<sub>1</sub> ≠ ''e''<sub>2</sub> .
|}
|}
A remaining sample of typical expressions will finish illustrating the use of this calculus.
A remaining sample of typical expressions will finish illustrating the use of this calculus.
<pre>
:{| cellpadding="4"
| (''e''<sub>1</sub> (''e''<sub>2</sub>))
| means
| ''e''<sub>1</sub> ⇒ ''e''<sub>2</sub> ,
|-
|
| i.e.
| if ''e''<sub>1</sub> then ''e''<sub>2</sub> ,
|-
|
</pre>
| i.e.
| not ''e''<sub>1</sub> without ''e''<sub>2</sub> .
|-
| ((''e''<sub>1</sub>)(''e''<sub>2</sub>)(''e''<sub>3</sub>))
| means
| ''e''<sub>1</sub> or ''e''<sub>2</sub> or ''e''<sub>3</sub> .
|-
| (''e''<sub>1</sub> , (''e''<sub>2</sub> , ''e''<sub>3</sub>))
| means
| ''e''<sub>1</sub> + ''e''<sub>2</sub> + ''e''<sub>3</sub> .
|}
=====3.1.1.2. Partitions : Genus and Species=====
=====3.1.1.2. Partitions : Genus and Species=====