def {i} and P RM 20. Let F def {R, F}; where i is a constant, F a predicate symbol with arity one and R a pedicate symbol with arity two. A model M contains a set of concrete elements A-which may be a set of states of a computer program. The interpretations M, RM, and FM may then be a designated initial state, a state transition relation, and a set of final (accepting) states, respectively. Let A def def {a,b,c}, m defa {(a, a),(a,b), (a, c), (6,c), (C, c)}, and FM def {b,c}. For the given model M, check the satisfaction relation ME 0, where : i) VrVyVz(R(ic, y) A R(x,x) + y = z) ii) VoDy R(x,y) 2 def {i} and P RM 20. Let F def {R, F}; where i is a constant, F a predicate symbol with arity one and R a pedicate symbol with arity two. A model M contains a set of concrete elements A-which may be a set of states of a computer program. The interpretations M, RM, and FM may then be a designated initial state, a state transition relation, and a set of final (accepting) states, respectively. Let A def def {a,b,c}, m defa {(a, a),(a,b), (a, c), (6,c), (C, c)}, and FM def {b,c}. For the given model M, check the satisfaction relation ME 0, where : i) VrVyVz(R(ic, y) A R(x,x) + y = z) ii) VoDy R(x,y) 2