Changes

: ''e''₁ ''e''₂ ''e''₃ means "''e''₁ and ''e''₂ and ''e''₃".

: ''e''₁ ''e''₂ ''e''₃ means "''e''₁ and ''e''₂ and ''e''₃".

The bound connectives are written as lists of ''k'' expressions (''e''₁, …, ''e''_''k''), where the parentheses and commas are considered to be parts of the connective notation.  In text presentations the parentheses will be superscripted, as ⁽''e''₁, …, ''e''_''k''⁾, to avoid confusion with other uses.  The bound connective is interpreted to mean that just one of the ''k'' listed expressions is false.  That is, ⁽''e''₁, …, ''e''_''k''⁾ is true if and only if exactly one of the expressions ''e''₁, …, ''e''_''k'' is false.  In particular, for ''k'' = 1 and 2:

The bound connectives are written as lists of ''k'' expressions (''e''₁, …, ''e''_''k''), where the parentheses and commas are considered to be parts of the connective notation.  In text presentations the parentheses will be superscripted, as ⁽''e''₁, …, ''e''_''k''⁾, to avoid confusion with other uses.  The bound connective is interpreted to mean that just one of the ''k'' listed expressions is false.  That is, ⁽''e''₁, …, ''e''_''k''⁾ is true if and only if exactly one of the expressions ''e''₁, …, ''e''_''k'' is false.  In particular, for ''k'' = 1 and 2, we have:

<pre>

(e1) means "not e1".

| (''e''₁)

 

| means

(e1,e2) means "e1 xor e2", "e1  + e2",

| not ''e''₁.

 

  or "e1 neq e2", "e1 =/= e2".

</pre>

| (''e''₁, ''e''₂)

| means

| ''e''₁ xor ''e''₂,

| ''e''₁ + ''e''₂,

| or

| ''e''₁ neq ''e''₂,

| ''e''₁ &ne; ''e''₂.

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.