The first two of these are properties of more general interactive proof systems.
A formal definition of zero-knowledge has to use some computational model, the most common one being that of a Turing machine.