True or False: In lambda calculus, alpha-conversion is the process of changing the names of bound variables in an expression without changing the expression's meaning. True False Save Answer Q2 1 Point Which of the following is equivalent to the expression Ax.xy (Az.zyz)? Ax. (xy) (Az.z(yz)) Ax. (x(y (Az.zyz))) Ax. (xy) (Az. (zyz)) (Ax.xy) (Az. (zyz)) Save Answer Which of the following is equivalent to the expression (Ax.xyz) Az.zz (xy)? Note: The correct answer will have more or less "all" possible explicit parentheses applied, so it may be helpful to rewrite the prompt expression with all implicit groupings first, then compare your answer to the provided ones. (Ax. (((xy) z) (Az. ((zz) (xy))))) (Ax. ((xy) z)) (Az. ((zz) (xy))) (Ax. (x (yz))) (Az. ((zz) (xy))) (Ax. ((xy) z)) (Az. (z (z (xy)))) Save Answer Q4 1 Point Which of the following expressions has exactly one free variable? (Ax.xz) y Ax.y(Ay.xy) z (Ay.Ax.xya) (Ax.Ay.xz)y

True or False: In lambda calculus, alpha-conversion is the process of changing the names of bound variables in an expression without changing the expression's meaning. True False Save Answer Q2 1 Point Which of the following is equivalent to the expression Ax.xy (Az.zyz)? Ax. (xy) (Az.z(yz)) Ax. (x(y (Az.zyz))) Ax. (xy) (Az. (zyz)) (Ax.xy) (Az. (zyz)) Save Answer Which of the following is equivalent to the expression (Ax.xyz) Az.zz (xy)? Note: The correct answer will have more or less "all" possible explicit parentheses applied, so it may be helpful to rewrite the prompt expression with all implicit groupings first, then compare your answer to the provided ones. (Ax. (((xy) z) (Az. ((zz) (xy))))) (Ax. ((xy) z)) (Az. ((zz) (xy))) (Ax. (x (yz))) (Az. ((zz) (xy))) (Ax. ((xy) z)) (Az. (z (z (xy)))) Save Answer Q4 1 Point Which of the following expressions has exactly one free variable? (Ax.xz) y Ax.y(Ay.xy) z (Ay.Ax.xya) (Ax.Ay.xz)y