My interest has *always* been in creating a human mind with software.
The *only* reason that I have ever explored formal semantics within
linguistics is to either directly meet this goal, or to indirectly meet
this
goal by breaking this goal down into its component parts.
The key aspect of breaking this goal down into its component parts is to
somehow formalize the precise functional equivalent of the human
understanding of natural language.
The key aspect of formalizing the precise functional equivalent of the
human
understanding of natural language is to formalize the meaning of concepts
and the connections between concepts such that the [natural order] of
the essential structure of the universal set of all conceptual knowledge
could be discovered and exhaustively specified (fully elaborated) in a
rigorous
mathematical way.
The key aspect of formalizing the meaning of concepts and the connections
between concepts such that the [natural order] of the essential
structure of
the universal set of all conceptual knowledge could be discovered is finding
a system of absolute minimum complexity such that every detail of any
concept could be exhaustively specified and thus fully elaborated.
The essential framework for accomplishing this goal is a knowledge ontology
directed graph using integer handles are placeholders referring to 100%
precisely
specified concepts, such that all of these concepts are entirely created
on the
basis of their connections to other concepts within this knowledge
ontology.
The [natural order] of this knowledge ontology is defined by eliminating
redundancy in this knowledge ontology. the nodes in the digraph represent
concepts and the edges in the digraph represent connections between
concepts.
The first guess of the types of concepts(nodes) and the types of
connections between these nodes (edges) is specified below:
http://en.wikipedia.org/wiki/History_of_type_theory#G.C3.B6del_1944
Gödel 1944
Kurt Gödel in his 1944 Russell's mathematical logic gave the following
definition of the "theory of simple types" in a footnote:
By the theory of simple types I mean the doctrine which says that the
objects of thought (or, in another interpretation, the symbolic
expressions) are divided into types, namely: individuals, properties of
individuals, relations between individuals, properties of such
relations, etc. (with a similar hierarchy for extensions), and that
sentences of the form: " a has the property φ ", " b bears the relation
R to c ", etc. are meaningless, if a, b, c, R, φ are not of types
fitting together.
Mixed types (such as classes containing individuals and classes as
elements) and therefore also transfinite types (such as the class of all
classes of finite types) are excluded. That the theory of simple types
suffices for avoiding also the epistemological paradoxes is shown by a
closer analysis of these. (Cf. Ramsey 1926 and Tarski 1935, p. 399).".[23]
Gödel 1944
Kurt Gödel in his 1944 Russell's mathematical logic gave the following
definition of the "theory of simple types" in a footnote:
By the theory of simple types I mean the doctrine which says that the
objects of thought (or, in another interpretation, the symbolic
expressions) are divided into types, namely: individuals, properties of
individuals, relations between individuals, properties of such
relations, etc. (with a similar hierarchy for extensions), and that
sentences of the form: " a has the property φ ", " b bears the relation
R to c ", etc. are meaningless, if a, b, c, R, φ are not of types
fitting together.
Mixed types (such as classes containing individuals and classes as
elements) and therefore also transfinite types (such as the class of all
classes of finite types) are excluded. That the theory of simple types
suffices for avoiding also the epistemological paradoxes is shown by a
closer analysis of these. (Cf. Ramsey 1926 and Tarski 1935, p. 399).".[23]