Additional examples are adjusted to the entries in an automated way - we cannot guarantee that they are correct.
Other widely used techniques for proving inexpressibility results, such as the compactness theorem, do not work in finite models.
Indeed, Ehrenfeucht-Fraïssé games provide a complete methodology for proving inexpressibility results for first-order logic.
The main application of Ehrenfeucht-Fraïssé games is in proving the inexpressibility of certain properties in first-order logic.
Another famous result that he proved is that first-order logic has a zero-one law, a tool for proving inexpressibility results for database query languages.
It is a phrase meant to convey the inexpressibility of Brahman in words and the futility of trying to approximate Brahman with conceptual models.
The device usually seems to work in a paradoxical fashion, pointing both at the 'inexpressibility' of what the prose is gesturing towards, and borrowing some of photography's apparently concrete realism.
An aspect of Tyler's slyness lies in her ability to write sentences that seem to present no resistance, that are perfectly clear in their direction, that don't send up metaphorical gestures by way of suggesting the inexpressibility of life.
In The Form the prose style shows Rolle at his best embodying his sense of "the expanding of love beyond desire" : The first sentence uses the inexpressibility topos - the rhetorical trick for gesturing towards the ineffable.
Phokion Kolaitis' slides and Neil Immerman's book chapter on Ehrenfeucht-Fraïssé games discuss applications in computer science, the methodology theorem for proving inexpressibility results, and several simple inexpressibility proofs using this methodology.