Formal systems that cannot possibly be incomplete except for unknowns and unknowable

When we define formal systems as a finite list of basic facts and allow semantic logical entailment as the only rule of inference we have systems that can express any truth that can be expressed in language.
Also with such systems Undecidability is impossible. The only incompleteness are things that are unknown or unknowable.
The language of such a formal system is an extended form of the Montague Grammar of natural language semantics. I came up with this mostly in the last two years. I have been working on it for 22 years.
The Montague Grammar Rudolf Carnap Meaning postulates are organized in a knowledge ontology inheritance hierarchy. https://en.wikipedia.org/wiki/Ontology_(information_science)
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer