LISP basis for computable functions on S-Expressions.

Hi all,

I want to make a minimal set of LISP functions, by which all computable functions on S-Expressions
can be computed. {car, cons, cdr, atom, equal, if} is a basis. I don't know how to prove that this is the minimal. Can you help me?

## Recent comments

20 min 19 sec ago

8 hours 22 min ago

9 hours 2 min ago

11 hours 5 min ago

13 hours 3 min ago

14 hours 24 min ago

14 hours 28 min ago

17 hours 51 min ago

17 hours 56 min ago

18 hours 2 min ago