gigipiscu

Thank you dionysus :D:D:D

is there anybody who could give a helping hand Show that conjunction (“and”) and disjunction ("or") is not a complete set of connectives for Propositional Logic. Thank you gigipiscu

[xx(][xx(][xx(] pls, I need a helping hand for this: Define the Lucas sequence by L(1) = 1;L(2) = 3, and L(n) = L(n-1) + L(n - 2) for n > 2 Define the Fibonacci sequence by F(0) = 1; F(1) = 1, and F(n) = F(n - 1) + F(n - 2) for n >= 2 Prove by induction that L(n) = F(n) + F(n - 2) for n >= 2. Thank you

:D:D:D It's working Thank you dionysus

here is not too easy one: devise a grammar whose language is the set : {a^n b^n a^m | n,m >=1} pls help Thank you :)