P. 1
Logic

Logic

|Views: 236|Likes:
Published by Nifflheim

More info:

Published by: Nifflheim on Nov 08, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/19/2013

pdf

text

original

PRACTICE
HARD

Background Section 4.3.1.2 of handout 4 defines the syntax of PLf. It is an efficient
definition, and I proposed it because it means that we can fit this system into the ones that
come later with no fuss. But the results quickly become hard to parse. Some examples,
with their more intuitive versions at right:

74

Problems

i. ((∧(p))(q))

(q p)

ii. (∨((∧(p))(q))(p))

(p∨(q p))

iii. ((∧(¬(p)))(p))

(p∧¬p)

The expressions are just tools for helping people understand what is happening with the
denotations (functions). At present, they are not particularly illuminating.

Your task Devise some new syntactic rules, replacements for those in (4.3.1.2), that
determine expressions of the sort at right but maintain the virtue of the current system that
∧,∧p, and the like are well formed.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->