Thread: Language recursive, sat recursive

Is it true that set SAT is recursive. ? ( SAT means satisfiability )

and Language a^k b^k c^k d^k | k=>0 } is recursive. ?

In my opinion both are true.

Of course, satisfiability is decidable, and the second language is decidable as well. It is relatively easy to write programs that decide memberships in those languages using some modern programming language.