Give the semantic type for each of the functions in (1).(1) a. λf(et) .tina(e)b. λg(e(et)).λx(e).g(x)(John(e))c. λf(et).λg(et).
∼(g(tina) ∧ f(tina))d. λg(et).λx(e). ∼(g(x))Simplify the expressions in (2) as far as possible using the beta-reduction rule and showing all intermediate steps.(2) a. (λx(e) .x)(mary(e))b. ((λx(e) .λf(et) .x)(tina(e) ))(tall(et) )c. ((λg(e(et)).λx(e).λy(e).g(y)(x))(shave(e(et))))(Mary(e))d. ((λg(e(et)).λx(e).g(x)(x))(shave(e(et))))(John(e))e. ((λf(et.)λg(tt).λx(e).g(f(x)))(tall(et)))(λy(t).1 − y)
What you could do it is. Start adding numbers and once you get close to 6 numbers See if you are close to 51 and switch around the numbers to make it equal 51 hope this helps
