Math+150+++F09-+Hwk+1+Solutions

Math+150+++F09-+Hwk+1+Solutions - SOLUTIONS TO HOMEWORK 1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SOLUTIONS TO HOMEWORK 1 MATH 150, FALL 09 Problem 1. Section 1.1/ Exercise 2 If is a formula, then either it is a sentence symbol or it is build by one of the formula building operations applied to other formulas. In the first case its length is 1, and in the second case its length is strictly greater than 3. So, there are no formulas of length 2 and 3. To show that there is no formula of length 6, suppose for contradiction that the length of is 6. if = ( ), then must have length 3, which we showed is impos- sible. if = ( ), where { , , , } , then length( )+ length( ) = 3. So one of them must have length 2, which is impossible. So, there are no formulas of length 6. To show that every other length is possible, note that: the length of ( A ) is 4, the length of ( A B ) is 5 the length of (( A B ) A ) is 9, for every formula of length n , we can build a formula of length n +3, by taking its negation Using this we can build formulas of length 7, 8 and any length greater than 9. Problem 2. Section 1.1/ Exercise 5 Part (a): We use induction on the complexity of ....
View Full Document

Page1 / 3

Math+150+++F09-+Hwk+1+Solutions - SOLUTIONS TO HOMEWORK 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online