From: Jors Dolderer on
Hi,

I wondered if a formal language exists where nobody ever had thought
of a problem you can't describe in it.

When I see something coming from the keyboard of a mathematician, I
often see a notation with inverted Es and As - I gained some google-
half-education about that, but I don't see how to formulate e.g. "The
Halting problem is undecidable" in such a language.
Is this possible?
If yes: How?
If no: Are there attempts to make this possible?

Of course, I don't mean attempts of the form "Be H the Halting problem
and D(X) the statement 'X is decidable.' Now we can - waow - state
'The Halting problem is decidable'".


Greets

Joris