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

1 day 10 hours ago

1 day 16 hours ago

1 day 16 hours ago

1 day 16 hours ago

2 days 9 hours ago

2 days 10 hours ago

3 days 10 hours ago

3 days 10 hours ago

5 days 19 hours ago

5 days 23 hours ago