The PACELC theorem seems awfully named to me.

Isn’t it really just that there’s a trade-off between latency and
consistency? I *think* you can treat network partitions as infinite
latency, so availability is a special case of latency (available =
finite latency).

So shouldn’t it just be the LC theorem? Seems more fundamental to me.