For =i=1,2,…,let F_(i ) denote the formula A_(i )∧ (there exist j>i) not A_j where A_i^' s are atomic formulas ;i.e.for any assignment script A ,script A(F_i) =1 iff A(A_i )=1 and there is a j>i such that script A(A_i )=0.Let S^ denote the set containing F_i for all i=1,2,…show that every finite subest of S is satisfiable but S is not satisfiable.
please help me to do this math logic.
(not A means the negation of A)