unique readability of parenthesized formulas

unique readability of parenthesized formulas

Given a set

V

of

propositional variables

, and a set

F

of

logical connectives

, one may form the set

V

¯

of

well-formed formulas

, or wffs. The appearance of a wff depends on the formation rule of a well-formed formula.

Auxiliary symbols

may or may not be used in the construction of a wff. In the parent entry, we proved that every well-formed formula constructed without the aid of auxiliary symbols has a unique appearance. In this entry, we show that, with the aid of auxiliary symbols such as parentheses, specifically,

unique readability

is achieved as well. The specific formation rule we have in mind is the following: if

p

1

,

…

,

p

n

are existing wffs, and

α

is

n

-ary, then so is

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

a wff.

Theorem 1

.

Wffs constructed using the formation rule above have unique readability.

We will only give a partial proof here, since the portion not proved can be easily produced by closely following the proof from the parent entry.

Sketch of Proof.

A wff has one of the following three forms:

v

,

(

#

)

, or

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

, where

v

is atomic (propositional variable),

#

and

α

are nullary and

n

-ary

connectives

respectively, with

n

>

0

, and all

p

i

are existing wffs.

First, it is easy to see that every wff has the same number of left parentheses as right parentheses, and every proper non-trivial

initial segment

of a wff has more left than right parentheses.

Now, suppose

p

and

q

are wffs and

p

=

q

. We look at the following cases:

•

If

p

is atomic, then so must be

q

, and vice versa.

•

If

p

=

(

#

)

, then

q

is either

(

@

)

where

@

is nullary, or

q

=

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

, where

α

is

n

-ary with

n

>

0

. However, the second choice is not possible, as the length of the word

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

is longer than

(

#

)

. So we are left with

(

@

)

. Canceling the parentheses in the

equation

(

#

)

=

(

@

)

, we have

#

=

@

.

•

If

p

=

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

, then

q

must have the form

(

β

⁢

q

1

⁢

⋯

⁢

q

m

)

. Equating the two expressions and canceling the parentheses, we get

α

=

β

and thus

m

=

n

. By an

argument

similar

to the one given in the parent entry, we see that

p

n

=

q

n

, utilizing the

function

ϕ

*

modified so that

ϕ

(

(

)

=

ϕ

(

)

)

=

0

. Continuing this, we see that

p

i

=

q

i

for all

i

=

1

,

…

,

n

.

In all three cases, we have unique readability, the proof is

complete

.
∎

Commas are also often used as auxiliary symbols in forming wffs to improve comprehensibility without violating unique readability.

Theorem 2

.

Wffs constructed using the following

formula

formation rule have unique readability: if

p

1

,

…

,

p

n

are existing wffs, and

α

is

n

-ary, then so is

α

⁢

(

p

1

,

…

,

p

n

)

a wff.

Sketch of Proof.

Like the last proof, a wff also has one of the three forms:

v

,

(

#

)

, or

α

⁢

(

p

1

,

⋯

,

p

n

)

, where

v

is atomic (propositional variable),

#

and

α

are nullary and

n

-ary connectives respectively, with

n

>

0

, and all

p

i

are existing wffs.

The rest of the proof goes pretty much the same as the last one. The last case deserves a little more attention:

If

p

=

α

⁢

(

p

1

,

…

,

p

n

)

, and

q

has the form

β

⁢

(

q

1

,

…

,

q

m

)

. We again have

α

=

β

and

m

=

n

, after equating

p

and

q

. Eliminating the parentheses, we get

p

1

,

…

,

p

n

=

q

1

,

…

,

q

n

. So

p

n

is a suffix of

q

1

,

…

,

q

n

, which means that it is either a suffix of

q

n

, or has the form

r

,

q

k

,

…

,

q

n

, where

r

is a suffix of

q

k

-

1

, and

k

≤

n

. In the latter case, if

r

is the

empty word

, then

p

n

=

,

q

k

,

…

,

q

n

, which is impossible because no wffs begins with a comma. So

r

is a non-trivial suffix of

q

k

-

1

. Using

ϕ

*

(see the parent entry) modified so that

ϕ

(

(

)

=

ϕ

(

)

)

=

ϕ

(

,

)

=

0

, we again show that

p

n

can not be

r

,

q

k

,

…

,

q

n

. Therefore,

p

n

is a suffix of

q

n

. We will let the reader finish the rest.
∎

Finally, another common practice is to infix a connective when it is binary. We again have unique readability:

Theorem 3

.

Wffs constructed using the following formula formation rule have unique readability: if

p

1

,

…

,

p

n

are existing wffs, and

α

is

n

-ary, then so is

(

α

⁢

p

1

⁢

…

⁢

p

n

)

a wff if

n

≠

2

, and so is

(

p

1

⁢

α

⁢

p

2

)

a wff if

n

=

2

.

Sketch of Proof.

The proof is very much the same as before. A wff in this case has four forms:

v

,

(

#

)

,

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

, or

(

q

1

⁢

β

⁢

q

2

)

. We only need to observe the following:

•

if

p

has the form

(

α

⁢

p

1

⁢

⋯

⁢

p

n

)

, and

p

=

q

, then

q

can not have the form

(

q

1

⁢

β

⁢

q

2

)

, for otherwise

q

1

begins with

α

, which is impossible, because a wff never begins with a connective symbol, as it either begins with a left parenthesis

(

, or is an atom.

•

so

p

has the form

(

p

1

⁢

α

⁢

p

2

)

and

q

has the form

(

q

1

⁢

β

⁢

q

2

)

, which means that

p

1

is a prefix of

q

1

β

q

2

)

. Then

p

1

is either a prefix of

q

1

, or has the form

q

1

⁢

β

⁢

r

, where

r

is a prefix of

q

2

)

. Let us look at the latter case.

r

can not be the empty word, for otherwise

p

1

=

q

1

⁢

β

, and no wffs end with a connective symbol.

r

can not be

q

2

or

q

2

)

, for otherwise

p

1

⁢

α

⁢

p

2

is longer (in length) than

q

1

⁢

β

⁢

q

2

. So

r

is a proper non-trivial prefix of

q

2

, but this is also impossible, for then

r

has more left than right parentheses, which means

q

1

⁢

β

⁢

r

, or

p

1

, a wff, has more left than right parentheses. This shows that

p

1

is a prefix of

q

1

.

The rest of the proof is now easy.
∎

Title

unique readability of parenthesized formulas

Canonical name

UniqueReadabilityOfParenthesizedFormulas

Date of creation

2013-03-22 18:52:44

Last modified on

2013-03-22 18:52:44

Owner

CWoo (3771)

Last modified by

CWoo (3771)

Numerical id

5

Author

CWoo (3771)

Entry type

Theorem

Classification

msc 03B05

Generated on Thu Feb 8 19:25:29 2018 by

LaTeXML