https://qualityhomeworkanswers.com/international-development-homework-help-19/

Any logicians or recursion/computability theorists who can help me to figure out how to approach the two problems below? Thanks much.1. Suppose that M is a structure with finite universe and finite alphabet. Show that the set of formulas “