Linearizability for read and write operations is synonymous with the term “atomic consistency” and is the "C" of the CAP Theorem
Linearizability is composable (or “local”) because, if operations on each object in a system are linearizable, then all operations in the system are linearizable.
Serializability is the traditional “I,” or isolation, in ACID
If users’ transactions each preserve application correctness (“C,” or consistency, in ACID), a serializable execution also preserves correctness. Therefore, serializability is a mechanism for guaranteeing database correctness.
Unlike linearizability, serializability does not—by itself—impose any real-time constraints on the ordering of transactions.
Serializability is also not composable.
Serializability does not imply any kind of deterministic order—it simply requires that some equivalent serial execution exists.
So FLP, with its strictly weaker restrictions - all messages are eventually delivered, faulty nodes don’t have to achieve consensus - is by this definition a stronger result than CAP, which allows messages to be lost forever and forces partitioned nodes to participate in the system.