For example, the formal definition of the Liskov Substitution Principal:
> Let ϕ(x) be a property provable about objects x of type T. Then ϕ(y) should be true for objects y of type S where S is a subtype of T.
This doesn't allow any change in behavior when subclassing. Not even the addition of logging, which makes the overriding of methods generally useless. Yet languages still provide this feature (perhaps to their detriment, but they still do).
There's also a common definition of the Liskov Substitution Principal:
> Functions that use pointers or references to base classes must be able to use objects of derived classes without knowing it.
This is, generally speaking, what people are talking about when the mention the Liskov Substitution Principal, unless they're actively writing an academic paper on the topic.
Bringing up the academic definition when someone is using the common definition is 1. not relevant and 2. usually not helpful.