(iii) Let X be a countably infinite set. (a) Write down a suitable set of propositional variables, a set of propositions
Posted: Wed May 11, 2022 9:26 pm
(iii) Let X be a countably infinite set. (a) Write down a suitable set of propositional variables, a set of propositions in those variables, and a bijection f from the set of valuations satisfying I to the set of graphs with vertex set X (b) Define what it means for a graph with vertex set X to be connected. Is there a set of propositions containing I that is satisfied by a valuation v if and only f(y) is connected? Justify your answer.